Classic quicksort algorithm
function quicksort ( objects , l , r , hash ) { if ( l < r ) { let mid = partition ( objects , l , r , hash ) ; quicksort ( objects , l , mid - 1 , hash ) ; quicksort ( objects , mid + 1 , r , hash ) ; } }