Skip to content

Add sorted.py to microbenchmarks #6086

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
youknowone merged 3 commits into from
Aug 28, 2025
Merged

Add sorted.py to microbenchmarks #6086

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
1a4289c
Add microbenchmark for `sorted`
Aug 9, 2025
6edde98
Mention how to run a specific benchmark
Aug 9, 2025
064a0e0
Update python version in bench README
Aug 13, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
Add microbenchmark for sorted 
I chose 5 * Iterations to try better show that RustPython
sort implementation scales noticeably worse CPython's
with respect to the number of elements.
  • Loading branch information
@jackoconnordev
Jack O'Connor authored and jackoconnordev committed Aug 26, 2025
commit 1a4289c9debb9f71f844e399124551c2d184a5bb
9 changes: 9 additions & 0 deletions benches/microbenchmarks/sorted.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
from random import random, seed
seed(0)

unsorted_list = [random() for _ in range(5 * ITERATIONS)]

# ---

# Setup code only runs once so do not modify in-place
sorted(unsorted_list)