2e4f5951e3
@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.
8 lines
226 B
Text
8 lines
226 B
Text
/-
|
|
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
Authors: Gabriel Ebner
|
|
-/
|
|
prelude
|
|
import init.data.array.basic
|
|
import init.data.array.qsort
|