Leonardo de Moura 2e4f5951e3 feat(library/init/data/array/qsort): simple quicksort ... @kha I added `qsort` for sorting environment extension entries, but I am wondering if we could use it as a benchmark in our paper. It is a pure implementation; it is fast; it implements the real quick sort algorithm with in-place updates if the input array is not shared. If the array is shared it performs a single copy and then switches to in-place updates.		2019-05-14 17:46:34 -07:00
..
basic.lean	chore(library/init/data/array/basic): make sure Array.*foldl and List.*foldl have similar signatures	2019-05-07 15:23:03 -07:00
default.lean	feat(library/init/data/array/qsort): simple quicksort	2019-05-14 17:46:34 -07:00
qsort.lean	feat(library/init/data/array/qsort): simple quicksort	2019-05-14 17:46:34 -07:00