Skip to content

CSPT7-Sorting-Karthik #293

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
kmk028 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

CSPT7-Sorting-Karthik #293

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
24 changes: 16 additions & 8 deletions src/iterative_sorting/iterative_sorting.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,21 +6,29 @@ def selection_sort( arr ):
smallest_index = cur_index
# TO-DO: find next smallest element
# (hint, can do in 3 loc)




for j in range (cur_index+1,len(arr)):
#compare all values to value of curr index
# find the smallest
if arr[j]<arr[smallest_index]:
smallest_index=j
# TO-DO: swap




arr[cur_index],arr[smallest_index]=arr[smallest_index],arr[cur_index]
return arr


# TO-DO: implement the Bubble Sort function below
def bubble_sort( arr ):
made_a_swap= True
while made_a_swap:
made_a_swap = False

for i in range(0,len(arr)-1):
j = i+1

if arr[i]>arr[j]:
arr[i],arr[j]=arr[j],arr[i]
made_a_swap=True

return arr


Expand Down