Sorting Algorithms Redux 05: Insertion Sort

Insertion sort, one of the last inefficient sorting algorithms we're looking at, before we move on to bigger and better things!

- Intro Theme Adapted From -
Licensed under Creative Commons: By Attribution 3.0
ISRC: USUAN1100879

= 0612 TV =

Enjoy your stay, and don't hesitate to drop me a comment or a personal message to my inbox =) If you like my work, don't forget to subscribe!

= NERDfirst =
NERDfirst is a project allowing me to go above and beyond YouTube videos into areas like app and game development. It will also contain the official 0612 TV blog and other resources.

-----

Disclaimer: Please note that any information is provided on this channel in good faith, but I cannot guarantee 100% accuracy / correctness on all content. Contributors to this channel are not to be held responsible for any possible outcomes from your use of the information.

[NERDfirst]

Hello again, and thank you very much for your comment!

Glad you found this series helpful!

[NERDfirst]

You're welcome, Shukran! I'm very happy to be of help =)

Thank you for your comment!

[NERDfirst]

You're welcome! I'm very happy to be of help =)

[NERDfirst]

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.

[NERDfirst]

Hello and thank you very much for your comment! Very happy to be of help =D

[NERDfirst]

Hello and thank you so much for your comment! Glad you like my videos =)

[NERDfirst]

Hello and thank you for your comment! Glad to be of help =)

[NERDfirst]

Hello and thank you for your comment! Happy to be of help =)

[NERDfirst]

Hello and thank you very much for your comment! I'm happy to be of help =)

[NERDfirst]

Hello and thank you very much for your comment! Glad you found the video helpful =)

[NERDfirst]

Thanks for your comment! Glad you found the video helpful =)

[amitasood]

Thanks for this amazing series. I have been trying so hard to understand all these concepts and you made it simple for me! :)

[elitegarbageman]

Thanks for doing these algorithm videos, dude.

[ladenkhamnian]

Your tutorials are very clear and quick. Thank you so much!

[NERDfirst]

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

[NERDfirst]

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!

[laurihosio]

Good explanations of the different sorting algorithms! 

[joehaas]

Very good video series! Thank you for sharing.

[NERDfirst]

Hello and thank you very much for your comment!

What are your doubts regarding its time complexity?

[fernandofigueredo]

the best explanation that i foud in the internet!!!!