Introduction to Selection Sort

Video 19 of a series explaining the basic concepts of Data Structures and Algorithms.

This video introduces the selection sort algorithm.

This video is meant for educational purposes only.

[tejasyt]

When my Sir though this I don't know, after seeing your video it really helped me.
Thanks a lot

[CapiT_T]

Thank you very much! I began with the binary search videos, and they were very helpful. Now, I'm continuing with the entire course

[manishdeshpande]

Nice and clear explanation. A big thumbs up for you.

[NoName-qphq]

Thank you for making this playlist.... Great teaching, thank you 👍🏻

[abyss]

Worth the time watching the explanation;
Hey keep it up please 🙂

[luckywhite]

Your lecture is so clear and easy, I didn't think twice before subscribing to youtube

[elisakrippner]

Great video took us through every step well. Thanks a lot.

[MiillioN]

Ek to tumhare voice se pyaar ho gaya hai and then your videos

[crystalkearneyhennings]

Excellent job! You've made this algorithm really easy to understand. Thank you.

[gaddamdevendrao]

Lalitha
Your voice is very sweet
I ❤ your voice
It's vary easy to understand
Txn for explanation this topic

[justmaahi]

my friends all are fallen love with ur explanation 😢 madam tqssss 🫶🏻

[zelda]

This is a great video however it would be great if you also mentioned the work of the inner loop not just the outer loop...for example at the very beginning the inner loop would do few swaps before the final swap of 6 and 15...it swaps 12 with 15 then 9 with 12 the finally 6 with 9...someone correct me if I'm wrong pls

[omarabdelkader]

Nice and clear explanation. A big thumbs up for you.
Thank you

[YoIntangible]

thanks for the explanation but how is this best implemented in code? nested loops or just a single loop i understand the concept but not how to execute it in code





Written in C. I.E.
a[] = {5, 2, 7, 4, 1, 6, 3, 0};

for (int i = 0; i < 8 -1; i++)
{
int temporaryV = a[ i ];

for ( int j = i + 1; j < i; j++)
{
if ( a[ j ] < temporaryV)
{
temporaryV = a[ j ];
a[ j ] = temporayV;
}
}
}

[Phomecan_]

I have my test tomorrow! This helped a lot- thanksss ;)

[juniorsrey]

Wow thank you for teaching us how to solve the solution sort please do more and make me happy

[ThemassiveTV]

You're really amazing mam ..you're really amazing .you explain it really good

[Lion]

Thank you I've exam with this Good explanation ❤

[MeghaNikam]

Great expectations
Easily understood....

[Akcricketshorts]

Thank you akka you have teached very simple and clear explaniation