question: public List < LocalDate > bottom ( int n ) { List < LocalDate > bottom = new ArrayList < > ( ) ; int [ ] values = data . toIntArray ( ) ; IntArrays . parallelQuickSort ( values ) ; for ( int i = 0 ; i < n && i < values . length ; i ++ ) { bottom . add ( PackedLocalDate . asLocalDate ( values [ i ] ) ) ; } return bottom ; }
target:  Returns the smallest ("bottom") n values in the column