Selection Sort | Live demo, visuals and code | Study Algorithms

Sorting is a really essential concept when it comes to computer programming. Selection sort is one of the 3 beginner sorting algorithms which can be used to arrange a set of elements in a certain pre-defined manner. As the name suggests, at every iteration, you “SELECT” an element and place it at its right position. But how do you select it? And where do you place it? Watch this video to see a visual explanation of what happens behind the scenes of Selection Sort with a live demo and a dry-run of the code.

00:00 - Intro
00:58 - Different sorting methods
02:02 - Live demo of Selection Sort
07:40 - Actual code dry-run
11:58 - Final thoughts

📚 Links I talk about in the video:

💻 Get Social 💻

#algorithms #sorting #tutorial

[Shreya-dtol]

amazing and simplest explanation ever!! Loved it😀

[GiridharaSaiPavanKumarGurram]

if the array is mostly sorted or already sorted. it is not good to use selection sort, it is going to find min element by traversing the rest of the array in every iteration