⚡️ Speed up function sorter by 400,759%
#151
Closed
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.
📄 400,759% (4,007.59x) speedup for
sorterincode_to_optimize/bubble_sort.py⏱️ Runtime :
3.75 seconds→935 microseconds(best of406runs)⚡️ This change will improve the performance of the following benchmarks:
📝 Explanation and details
The given code sorts a list using a bubble sort algorithm, which has a time complexity of ( O(n^2) ). To improve its performance, we can use the built-in Python sorting function, which uses Timsort and has an average time complexity of ( O(n \log n) ).
Here's the optimized version of the program.
✅ Correctness verification report:
⚙️ Existing Unit Tests Details
🌀 Generated Regression Tests Details
To edit these changes
git checkout codeflash/optimize-sorter-m9kc32axand push.