Idea is nice in principle, but as you increase number of pivots it boils down to hashtable. In my humble opinion main difference between quicksort and binary s

Idea is nice in principle, but as you increase number of pivots it boils down to hashtable. In my humble opinion main difference between quicksort and binary search is that one sorts numbers quickly, second is efficient in chasing down pointers. Ideally you want to avoid chasing pointers down at all, thus hashtable.