public List<LocalTime> bottom(int n){
  List<LocalTime> bottom=new ArrayList<>();
  int[] values=data.toIntArray();
  IntArrays.parallelQuickSort(values);
  for (int i=0; i < n && i < values.length; i++) {
    bottom.add(PackedLocalTime.asLocalTime(values[i]));
  }
  return bottom;
}

public List < LocalTime > bottom ( int n ) { List < LocalTime > bottom = new ArrayList < > ( ) ; int [ ] values = data . toIntArray ( ) ; IntArrays . parallelQuickSort ( values ) ; for ( int i = 0 ; i < n && i < values . length ; i ++ ) { bottom . add ( PackedLocalTime . asLocalTime ( values [ i ] ) ) ; } return bottom ; }
returns the smallest ( " bottom " ) n values in the column
