This video isn't available yet.
Loading video
Quick sort
Computer Science · Algorithms 12 views
Pick the last number as pivot and partition. Equal is not smaller, so the pivot 2 can jump past the other 2. Average time O of n log n; worst O of n squared.
partitionquick sortsortingunstable