Skip to content

perf: use built-in sorted() in DsList.sort_list #35

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

Open
m-truscott wants to merge 1 commit into
base: main
Choose a base branch
from
Open

perf: use built-in sorted() in DsList.sort_list #35

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
Batch update (1 files)
  • Loading branch information
@artemisTurintech
artemisTurintech committed Jun 5, 2026
commit f678414bba637993939934ac46e5706775174536
8 changes: 1 addition & 7 deletions src/llm_benchmark/datastructures/dslist.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -45,13 +45,7 @@ def sort_list(v: List[int]) -> List[int]:
Returns:
List[int]: Sorted list of integers
"""
ret = v.copy()
for i in range(len(ret)):
for j in range(i + 1, len(ret)):
if ret[i] > ret[j]:
ret[i], ret[j] = ret[j], ret[i]

return ret
return sorted(v)

@staticmethod
def reverse_list(v: List[int]) -> List[int]:
Expand Down