Skip to content
This repository was archived by the owner on Oct 10, 2025. It is now read-only.

Mega sorting #82

Open
TenkoShim wants to merge 3 commits into
base: main
Choose a base branch
from
Open

Mega sorting #82

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
2c231a2
Implement base sorting
cypok Oct 15, 2022
ccf6898
Use better sorting algorithm
cypok Oct 15, 2022
ba2edc2
Make sorting more verbose
cypok Oct 15, 2022
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
16 changes: 16 additions & 0 deletions sort.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
arr = [40, 4, 20, 10, 30, 6, 10]

# insertion sort:
for i in range(1, len(arr)):
a_i = arr[i]
j = i - 1
while j >= 0:
print("comparing {} and {}".format(arr[j], a_i]))
Copy link
Copy Markdown
Collaborator

@cypok cypok Oct 24, 2023

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

You wouldn't believe it, but it still doesn't work!!!

if arr[j] > a_i:
arr[j + 1] = arr[j]
else:
break
j -= 1
arr[j + 1] = a_i

print(arr)