public void sortFromTo(int from,int to){
  double N=to - from + 1;
  double quickSortEstimate=N * Math.log(N) / 0.6931471805599453;
  double width=256;
  double countSortEstimate=Math.max(width,N);
  if (countSortEstimate < quickSortEstimate) {
    countSortFromTo(from,to);
  }
 else {
    quickSortFromTo(from,to);
  }
}

public void sortFromTo ( int from , int to ) { double N = to - from + 1 ; double quickSortEstimate = N * Math . log ( N ) / 0.6931471805599453 ; double width = 256 ; double countSortEstimate = Math . max ( width , N ) ; if ( countSortEstimate < quickSortEstimate ) { countSortFromTo ( from , to ) ; } else { quickSortFromTo ( from , to ) ; } }
sorts the specified range of the receiver into ascending order . the sorting algorithm is countsort .
