10 comments

[ 4.3 ms ] story [ 77.4 ms ] thread
Is anyone that's not a monolingual turd such as myself able to translate what's being said?
Performance analysis: sort of 10 elements in 256 seconds (4:16 min.).
O(nlogn), but with very large constants :-)
Heap-Sort

https://youtu.be/Xw2D9aJRBY4

Binary Search

https://youtu.be/iP897Z5Nerk

Quick-Sort

https://youtu.be/ywWBy6J5gz8

Bubble-Sort

https://youtu.be/lyZQPjUT5B4

I will bring my dancing shoes to the next FAANG interview.

If anyone is wondering why QuickSort's video is longer than BubbleSort's, notice that "swaps" in QSort are done in linear time (i.e the dancers are walking to their swapped positions) instead of constant time.
I'm a highly visual person and holy... the quicksort one really helps in remembering whats going on. I also like how the are dancing out the 'sort in place' version
Pointless nit-pickery: other than to cutely divide genders at the start and pair then up at the end there is no need for the initial split to divide between odd & even numbers. Just in case anyone is assuming an initialisation requirement/process that doesn't actually exist.