shift click flag for turbo mode
you can check speed of algorithm by unattatching the pink render from the end of swap poplar sort is an inplace but slightly slower derivation of smoothsort which is an adaptive variation of heapsort that puts everything into perfect binary max heaps called poplars. a perfect heap has every level completely filled. it then extracts the max out of all of the forest of poplars and puts it at the end like heapsort and restores the heap property on the forest, repeating like heapsort unstable adaptive space - O(1) inplace time compl - O(nlogn)
