Ross Memes

Quicksort's whole thing is choosing a pivot element to partition your array around. You know, that crucial step that determines whether you get O(n log n) performance or accidentally write bubble sort with extra steps. The Friends reference here is *chef's kiss* because Ross screaming "PIVOT!" while trying to move a couch up a narrow staircase is basically what your algorithm does when it's recursively dividing the array. Except Ross failed spectacularly at moving furniture, and if you pick bad pivots (looking at you, always-choosing-the-first-element), your quicksort will also fail spectacularly with O(n²) worst-case performance on sorted data. The couch got stuck, your algorithm gets stuck. Poetry.