Sorting Algorithms Redux 02: Selection Sort

We take a look at the most basic and intuitive sorting algorithm - Selection sort!

- 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 and thank you so much for your comment! Glad you found my work useful =)

[NERDfirst]

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

[NERDfirst]

Hello and thank you very much 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 for your comment!

I don't take any responsibility for any consequences that may arise out of that =P

[NERDfirst]

Hello and thank you for your comment!

While there are rigorous ways to evaluate time complexity, I use the "intuitive" method for all my sorting algorithm videos.

Notice how that, when selection sort runs, it iterates n times over n items. This makes for a total of n*n, or n² comparisons.

[NERDfirst]

Hello and thank you for your comment! Not very sure if I can hear any similarities, but I wrote this short piece myself, probably 3-4 years ago!

[NERDfirst]

Hello and thank you very much for your comment! I'm glad the whole thing worked out for you then!

As far as I'm aware though, I think in the grand scheme of things, the one-array method is probably more "correct" in the sense that it is the more space-efficient way of doing selection sort. That's why I was keen to correct my previous mistake in this video.

[NERDfirst]

Hello and thank you for your comment!

I'm considering eventually doing this, but this wouldn't be for at least another couple of months.

[NERDfirst]

Hello again, and thank you for your comment!

In general, comparisons are the issue, since the act of swapping takes constant time, which is ignored when we look at time complexity.

[NERDfirst]

You're welcome =) Happy learning!

[preciouswocha]

Wow!! I love the way you explain. It is simple and concise.

[RyanHansen_]

You explain sorting algorithms, so much better than my lecturer :D Thank you Icc0612!!! :)

[samaysoni]

I need to present this today in office for the training. I love you bro, you saved my life

[biteshtiwari]

 consice  video with all the information required.
great work.

[MKULTRA]

Great video. In the course I'm taking selection sort is described as using 2 arrays like your original video, so thanks for explaining both.

[jimmyrussel]

While you're looping through the list looking for the smallest number, you could make it look for the biggest number at the same time. You would then make it put the smallest number at the beginning, as you would normally, but also put the biggest number at the end. The result of this is that it would only need to loop through half of the list of numbers, thus increasing the performance of selection sort.

[amitasood]

Thank you for this simple and easy to understand video. Could you please upload videos regarding implementation of all these algorithms in programs?

[BantegizeTamene]

i got interseting for ma individual assignment.... reallly ur hero!!!!

[larssonk]

Why does my tutor spend half an hour explaining this algorithm when it can evidently be taught within 5minutes!?

subbed!