Hello and thank you for your comment. Many of my videos since late 2011 have been processed with noise removal in audacity, and I have used it to record since my earliest videos. My preference is to keep the narration as close to the original as possible, hence you will always hear some residual room tone after my noise removal pass since my settings are subtle. What I really need to fix are the acoustics of my recording area, not fiddle around with already broken audio in post! =P
Hello and thank you for your comment! It's very specific, so I don't expect to do a video on it. However, here are some thoughts that would help you. During the backtracking phase, while the "selected" item is moved back over the sorted sublist, perform an additional check: If the item being observed in the sublist is equal to the item being moved back, remove it from the array. You'll only "drop" the selected item into the sublist when the item observed is less than the selected item.
Cheers! Glad you found the video helpful =) Currently, I do not have videos on the more complex sorting algorithms. Heapsort requires you to understand how heaps work, how to create a heap, and how to maintain the heap property. It's quite a lot of content that I have yet to cover, and definitely too much to cover in a single 500 character text box!
Hello and thank you very much for your comment! I'm very happy you like my work =) I do tutorials every week on various computing/multimedia-related topics, and I also have two pretty thoroughly fleshed-out series on sorting algorithms. Thanks for subscribing, hope to see you around on the other videos too =)
thank you very man !! this video really helped !! if u get the time do u mind making a video that compares (against each other) how some of these algorithms operate
You're welcome! Glad to be of help =) Could you please elaborate further on the comparisons? The way I see it, the algorithms are all pretty different, so it's not easy to directly compare the way they operate!
May I suggest to use Audacity to reduce the noise in the audio? I sent you a presonal message so that you can check some tutorials on how to do it. It basically uses the noise reduction tool in Audacity.
Audacity's noise removal is barely noticeable. If you really want good audio, using a good microphone is the solution. Of course excellent microphones are expensive. Check craisgslist or your country's equivalent to check if audio studios are giving away studio microphones.
You're welcome! I'm glad you found the episode helpful, and I'm glad you like that shirt. (I don't ever dare to wear it outdoors, I get funny looks! =P) Thank you very much for your comment =)
It doesn't really look like you swap the elements of the list with the number you're testing. What I mean here is, based on the video, you "move" the nessecary elements to the right until you can insert the number (that you've kept track) instead of swaping the numbers. Anyways, these still are great videos, thank you very much for your work.
Hello and thank you for your comment! I've expressed the idea as swapping because that's how it's actually done in real-world implementations. Don't forget - In the video I can visualize the item as "floating outside" the array, looking for a slot to be inserted in, but in an actual array, everything needs to be moved around within the array itself.
Thank you very much for this series. It's great stuff! Just a quick question. Am I overlooking something or why does this algorithm have to do n comparisons and not n-1? Because if everything else is in order you could safely assume that the last one is too, no?
+Martin Habsburger You're welcome! Glad you're liking the series so far =) You can indeed! I was either abusing notation, or absolutely not optimizing in any way. In fact, for some implementations of insertion sort, you can consider one less item every iteration.
Hello again! I am flying a USB Studio Condenser mic (check out my channel for reviews and tips/tricks videos!), so I am getting pretty good audio. Problem is I live in a very population-dense area. A lot of cars and a lot of people, plus the room I am in is mostly just concrete wall. So the ever-present noise is trapped and amplified in the room! I'm considering better soundproofing means, but because I'm sharing this room I can't just jump right in and put like foam boards up all over xD
Hello again, and thank you very much for your comment!
Glad you found this series helpful!
Hello and thank you so much for your comment! Glad you like my videos =)
Hello and thank you very much for your comment! Very happy to be of help =D
Hello and thank you very much for your comment! I'm happy to be of help =)
Hello and thank you for your comment! Happy to be of help =)
Hello and thank you for your comment! Glad to be of help =)
You're welcome, Shukran! I'm very happy to be of help =)
Thank you for your comment!
Hello and thank you very much for your comment! Glad you found the video helpful =)
Thanks for your comment! Glad you found the video helpful =)
Hello and thank you for your comment.
Many of my videos since late 2011 have been processed with noise removal in audacity, and I have used it to record since my earliest videos.
My preference is to keep the narration as close to the original as possible, hence you will always hear some residual room tone after my noise removal pass since my settings are subtle.
What I really need to fix are the acoustics of my recording area, not fiddle around with already broken audio in post! =P
Hello and thank you for your comment!
It's very specific, so I don't expect to do a video on it. However, here are some thoughts that would help you.
During the backtracking phase, while the "selected" item is moved back over the sorted sublist, perform an additional check: If the item being observed in the sublist is equal to the item being moved back, remove it from the array.
You'll only "drop" the selected item into the sublist when the item observed is less than the selected item.
You're welcome! I'm very happy to be of help =)
Thanks for this amazing series. I have been trying so hard to understand all these concepts and you made it simple for me! :)
Hello and thank you very much for your comment!
What are your doubts regarding its time complexity?
Cheers! Glad you found the video helpful =)
Currently, I do not have videos on the more complex sorting algorithms. Heapsort requires you to understand how heaps work, how to create a heap, and how to maintain the heap property. It's quite a lot of content that I have yet to cover, and definitely too much to cover in a single 500 character text box!
Thanks for doing these algorithm videos, dude.
Your tutorials are very clear and quick. Thank you so much!
laden khamnian You're welcome! Very happy to be of help =)
Good explanations of the different sorting algorithms!
Thank you very much! Glad you found the videos useful =)
THANK YOU ! Shukran from Egypt
Can you do one on a method, which removes duplicates from an array?
thank u so much for making it so simple..but i cudn't find any lecture on heapsort..can u give some pointer on that?
wow, where were you all this time?! This is my first video from your channel but I hope you make more content of this type.
Hello and thank you very much for your comment!
I'm very happy you like my work =) I do tutorials every week on various computing/multimedia-related topics, and I also have two pretty thoroughly fleshed-out series on sorting algorithms. Thanks for subscribing, hope to see you around on the other videos too =)
I love these tutorials!
Very good video series! Thank you for sharing.
+Joe Haas Hello and thank you very much for your comment! Glad you're liking the series so far =)
These tuts are awesome
Awesome series...
I know n-1 is the number of passes, but is it also the number of comparisons as well?
the best explanation that i foud in the internet!!!!
Thank you! Glad you liked the video =)
best video for sorting algorithm
Thank you very much! Glad you liked the video =)
thank you very man !!
this video really helped !! if u get the time do u mind making a video that compares (against each other) how some of these algorithms operate
You're welcome! Glad to be of help =)
Could you please elaborate further on the comparisons? The way I see it, the algorithms are all pretty different, so it's not easy to directly compare the way they operate!
Very well explained.
Thank you very much! Glad to be of help =)
Great Video...... Very Very Helpful. But i still need help on its Complexity
Very good video! Thank you.
Oh wow thanks. Really good video :)
You save my grades in sorting algorithm :D
That's great to hear! Well done.
May I suggest to use Audacity to reduce the noise in the audio?
I sent you a presonal message so that you can check some tutorials on how to do it. It basically uses the noise reduction tool in Audacity.
Great video helped a lot :] Thanks
great tutorial
Audacity's noise removal is barely noticeable. If you really want good audio, using a good microphone is the solution. Of course excellent microphones are expensive. Check craisgslist or your country's equivalent to check if audio studios are giving away studio microphones.
yo ur shirt is sick! thanks for helping me...
You're welcome! I'm glad you found the episode helpful, and I'm glad you like that shirt. (I don't ever dare to wear it outdoors, I get funny looks! =P)
Thank you very much for your comment =)
It doesn't really look like you swap the elements of the list with the number you're testing. What I mean here is, based on the video, you "move" the nessecary elements to the right until you can insert the number (that you've kept track) instead of swaping the numbers. Anyways, these still are great videos, thank you very much for your work.
Hello and thank you for your comment! I've expressed the idea as swapping because that's how it's actually done in real-world implementations. Don't forget - In the video I can visualize the item as "floating outside" the array, looking for a slot to be inserted in, but in an actual array, everything needs to be moved around within the array itself.
Thank you soooo much!!!
You're welcome! Glad to be of help =)
it was very helpful! thank you
+Gleicy Betcel You're welcome! Very happy to be of help =)
Thank you very much for this series. It's great stuff!
Just a quick question. Am I overlooking something or why does this algorithm have to do n comparisons and not n-1? Because if everything else is in order you could safely assume that the last one is too, no?
+Martin Habsburger You're welcome! Glad you're liking the series so far =)
You can indeed! I was either abusing notation, or absolutely not optimizing in any way. In fact, for some implementations of insertion sort, you can consider one less item every iteration.
its great ... thank u buddy :)
TKS :-)
great
Hello again! I am flying a USB Studio Condenser mic (check out my channel for reviews and tips/tricks videos!), so I am getting pretty good audio.
Problem is I live in a very population-dense area. A lot of cars and a lot of people, plus the room I am in is mostly just concrete wall. So the ever-present noise is trapped and amplified in the room!
I'm considering better soundproofing means, but because I'm sharing this room I can't just jump right in and put like foam boards up all over xD
Hello and thank you very much for your comment! Glad to be of help =)
Hello and thank you very much for your comment! Glad to be of help =)
Hello and thank you very much for your comment! Glad to be of help =)