⚡️ Speed up function sorter
by 253,809%
#153
Open
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
📄 253,809% (2,538.09x) speedup for
sorter
inbubble_sort.py
⏱️ Runtime :
68.7 milliseconds
→27.1 microseconds
(best of1036
runs)📝 Explanation and details
The given code is an implementation of the bubble sort algorithm, which is not very efficient with its (O(n^2)) time complexity. We can significantly improve this by using the built-in
sort
method in Python, which has an average-case (O(n \log n)) time complexity.Here’s the optimized version.
Or if you want to sort the list in place without creating a new list.
Both
sorted()
andsort()
methods are highly optimized and use Timsort, which is faster and more efficient in most cases compared to bubble sort.✅ Correctness verification report:
🌀 Generated Regression Tests Details
To edit these changes
git checkout codeflash/codeflash/optimize-sorter-m7dqhw9u
and push.