Skip to content

⚡️ Speed up function sorter by 101% #708

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

Closed
wants to merge 1 commit into from
Closed

⚡️ Speed up function sorter by 101% #708

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
15 changes: 11 additions & 4 deletions code_to_optimize/bubble_sort_codeflash_trace.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,14 +1,19 @@
from codeflash.benchmarking.codeflash_trace import codeflash_trace


@codeflash_trace
def sorter(arr):
for i in range(len(arr)):
for j in range(len(arr) - 1):
swapped = False
for j in range(len(arr) - 1 - i):
if arr[j] > arr[j + 1]:
temp = arr[j]
arr[j] = arr[j + 1]
arr[j + 1] = temp
arr[j], arr[j + 1] = arr[j + 1], arr[j]
swapped = True
if not swapped:
break
return arr


@codeflash_trace
def recursive_bubble_sort(arr, n=None):
# Initialize n if not provided
Expand All @@ -27,10 +32,12 @@ def recursive_bubble_sort(arr, n=None):
# Recursively sort the remaining n-1 elements
return recursive_bubble_sort(arr, n - 1)


class Sorter:
@codeflash_trace
def __init__(self, arr):
self.arr = arr

@codeflash_trace
def sorter(self, multiplier):
for i in range(len(self.arr)):
Expand Down
Loading