sorts: add cross-algorithm benchmark (sorts/benchmark_sorts.py)

[priya-sundaram-dev]

As discussed in #15234, this adds a single place to compare the sorting algorithms in sorts/ on the same datasets, instead of embedding timing code inside individual algorithm modules.

sorts/benchmark_sorts.py:

• Imports 11 general-purpose comparison sorts from their existing modules (no sort is re-implemented here).
• Times each on shared, seeded random-integer datasets of a few sizes and prints a small table.
• Gives every algorithm a fresh copy of the data each run, so in-place sorts don't hand an already-sorted list to the next repetition.
• Ships doctests for the helpers (is_sorted, all_sorts_agree) that verify every algorithm agrees with Python's built-in sorted; the timing itself stays under if __name__ == "__main__" so it doesn't slow down the doctest suite.

Run it from the repo root:

python -m sorts.benchmark_sorts

Example output:

algorithm                      100        1000        3000
----------------------------------------------------------
comb_sort                   0.0001      0.0022      0.0106
heap_sort                   0.0003      0.0018      0.0067
merge_sort                  0.0002      0.0023      0.0081
quick_sort                  0.0001      0.0012      0.0033
shell_sort                  0.0001      0.0011      0.0042
bubble_sort                 0.0003      0.0384      0.3664
...

Happy to add/remove algorithms or adjust the sizes/columns to taste.

[algorithms-keeper]

Click here to look at the relevant links ⬇️

🔗 Relevant Links

Repository:

• Contributing guidelines
• Project Euler solution guidelines

Python:

• Formatted string literals (f-strings)
• Type hints
• doctest
• unittest
• pytest

Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.

---

algorithms-keeper commands and options

algorithms-keeper actions can be triggered by commenting on this PR:

• @algorithms-keeper review to trigger the checks for only added pull request files
• @algorithms-keeper review-all to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.

NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.

[cclauss]

Super cool!

[algorithms-keeper]

Click here to look at the relevant links ⬇️

🔗 Relevant Links

Repository:

• Contributing guidelines
• Project Euler solution guidelines

Python:

• Formatted string literals (f-strings)
• Type hints
• doctest
• unittest
• pytest

Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.

---

algorithms-keeper commands and options

algorithms-keeper actions can be triggered by commenting on this PR:

• @algorithms-keeper review to trigger the checks for only added pull request files
• @algorithms-keeper review-all to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.

NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.

[algorithms-keeper]

As there is no test file in this pull request nor any test function or class in the file sorts/benchmark_sorts.py, please provide doctest for the function __lt__

[cclauss]

LOL!!!

[algorithms-keeper]

As there is no test file in this pull request nor any test function or class in the file sorts/benchmark_sorts.py, please provide doctest for the function main

[priya-sundaram-dev]

Thanks for the merge! 😄 The keeper flagging main() right as it went in is a fun coda. I took a look at require_doctest.py — init is already exempt via the INIT check in visit_FunctionDef, so teaching it to skip main() too is a small change plus a couple of VALID/INVALID cases. Happy to open a PR on algorithms-keeper if that would be welcome — just say the word.