BENCH: add more sort benchmarks

benchmark for random, all equal elements, many equal elements and median
of 3 worst case

1 files changed, 28 insertions, 0 deletions

diff --git a/benchmarks/benchmarks/bench_function_base.py b/benchmarks/benchmarks/bench_function_base.py
index 35d355ffa..23103ba66 100644
--- a/benchmarks/benchmarks/bench_function_base.py
+++ b/benchmarks/benchmarks/bench_function_base.py
@@ -71,16 +71,44 @@ class Sort(Benchmark):
     def setup(self):
         self.e = np.arange(10000, dtype=np.float32)
         self.o = np.arange(10001, dtype=np.float32)
+        np.random.seed(25)
+        np.random.shuffle(self.o)
+        # quicksort implementations can have issues with equal elements
+        self.equal = np.ones(10000)
+        self.many_equal = np.sort(np.arange(10000) % 10)
+
+        # quicksort median of 3 worst case
+        self.worst = np.arange(1000000)
+        x = self.worst
+        while x.size > 3:
+            mid = x.size // 2
+            x[mid], x[-2] = x[-2], x[mid]
+            x = x[:-2]
 
     def time_sort(self):
         np.sort(self.e)
 
+    def time_sort_random(self):
+        np.sort(self.o)
+
     def time_sort_inplace(self):
         self.e.sort()
 
+    def time_sort_equal(self):
+        self.equal.sort()
+
+    def time_sort_many_equal(self):
+        self.many_equal.sort()
+
+    def time_sort_worst(self):
+        np.sort(self.worst)
+
     def time_argsort(self):
         self.e.argsort()
 
+    def time_argsort_random(self):
+        self.o.argsort()
+
 
 class Where(Benchmark):
     def setup(self):