Algorithms EXPLAINED in 30 seconds: Selection Sort 👩‍💻 #technology #programming #software

[lukaschumchal]

Thank you so much for this. This is gold to me, because I am so struggling to find every essential information about pc/programming in general. So sure you are lifesaver!!

[mariusschatz]

again a banger video, but i think the pointers are a little bit off? for example they just randomly merge and split. love the videos and effort though!!! <33

[brentbottoms]

ThT graphic made no sense with the way you explained the orange going to the smallest value then not sticking on one

[guoxiangmo]

how selection sort works:(231456)compare the number unsorted(2)with the array and find a smaller number(1)swap(132456)compare the second unsorted number(3) and find a smaller one in the right the right half to swap(no number)compare(4)and again no number is smaller then(4) compare(5)again no number is smaller then(5) there is nothing after (6) so it is done(123456)

[CodingWithLewis]

What algorithm would you like to see me do next? 🤔

[the_infinity_snake]

The animation is not good,
it causes confusion instead of making it easier to understand. 😄

[ettiennevanzyl]

If you have access to a sorting library or just know how to do it just stick with merge sort which has a O(n log n) complexity for the worst case.

[suyashbhawsar]

It would be fun to learn DSA like this.

[AhmedHemaz]

Programming languages implement mostly quick sort as a sorting algorithm

[LowLevelLemmy]

Congrats on 100k Lewis. I love ur vids.

[kamaljitkaur]

Please Make more videos explaining concepts

[hritikapal]

Please continue this DSA series would be willing to see more duration videos over these topics

[maysonrider]

I used Recurison of the sort fxn To Not have my Smallest value be changed to the next comparing unit . Because I never learned it by anyone and just heard how it happens 💀

[thodang]

Selection sorting is better than insertion sort is wrong. Insertion sort has best case in O(n) while selection sort still O(n2)

[Rumplestiltzchen]

I'm sorry but you already failed at the beginning: "index" is not a word a 5 year old would understand. Try using pointy picky thingy

[gingeral]

I was told insertion sort was faster than selection. Is this not true?

[max_k]

Bubble, insertion and selection all have the same time complexities and all sort in place. What makes selection more powerful?

[hachihao]

It should just have been "pick the smallest value, swap it with the top, ignore the top and repeat"

[sinasj]

im teacher and i like to know how you create sort animation

[sirussalari]

The explanation of the algorithm is correct, but the time complexity is incorrect.

Selection sort actually has the worst time complexity (including best, average, and worst case) out of all the sorting algorithms.

No matter what case, selection sort’s time complexity is O(n^2) which is pretty terrible