Add microbenchmark for sorted

Jack O'Connor · Jack O'Connor · commit 338b462373bb · 2025-08-10T09:09:40.000+01:00
I chose 5 * Iterations to try better show that RustPython
sort implementation scales noticeably worse CPython's
with respect to the number of elements.
diff --git a/benches/microbenchmarks/sort.py b/benches/microbenchmarks/sort.py
@@ -0,0 +1,7 @@
+from random import random
+
+unsorted_list = [random() for _ in range(5 * ITERATIONS)]
+
+# ---
+
+unsorted_list.sort()
