while quicksort does have n² worst case, its generally 2-3x faster than merge and variations like pdq garauntee nlogn
@KenjiLaurvick4 ай бұрын
Radix sort would be an easy s tier due to the sorting algorithm being better than n log(n)
@TungNguyenDinh-x6f14 күн бұрын
give it a list of name
@Raikuthedragon7 ай бұрын
Block sorts like: wiki sort, sqrt sort and grail sort(which looks pretty cool in visualisation). They have nlogn complexity in all cases, are in-place AND stable.
@حسابالدراسة-خ6ز6 ай бұрын
I just started learning about sorting algorithms, honestly this video helped me understand much more about them. thxs!
@trayle60357 ай бұрын
Radix sort would also be S tier for me
@rgosens27 ай бұрын
2:34 "just like SELECTION sort"
@fredericoamigo4 ай бұрын
Bogo-sort in S tier😂😂
@manuelgonzales64838 ай бұрын
🎉❤
@gourabsarker95528 ай бұрын
Sir do you earn 200k dollars a year? Plz reply. Thanks a lot.