Classic quicksort algorithm
static void quicksort ( Vector < String > objects , int l , int r , Map < String , Integer > hash ) { if ( l < r ) { int mid = partition ( objects , l , r , hash ) ; quicksort ( objects , l , mid - 1 , hash ) ; quicksort ( objects , mid + 1 , r , hash ) ; } }