Skip to content

Michael Agard #2

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 8 commits into from
Closed

Michael Agard #2

Changes from 1 commit
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
e820ca6
init commit
fellanonymous Jan 16, 2019
a47196a
updated PR link
fellanonymous Jan 16, 2019
1b2cc8b
add __pycache__
fellanonymous Jan 16, 2019
22befe6
add selection_sort function
fellanonymous Jan 16, 2019
30b9c93
first try
fellanonymous Jan 17, 2019
806bd7f
fixed iterate_sorting
fellanonymous Jan 17, 2019
ae21a9c
removed print
fellanonymous Jan 17, 2019
a81341b
finished Linear Search
fellanonymous Jan 17, 2019
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
Prev Previous commit
Next Next commit
removed print
  • Loading branch information
@fellanonymous
fellanonymous committed Jan 17, 2019
commit ae21a9cbae2dacf9af413d33530444b5c1d64808
3 changes: 0 additions & 3 deletions project/iterative_sorting.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,6 @@ def selection_sort(arr):
def insertion_sort(arr):
for i in range(1, len(arr)):
cur_index = i
print(arr)
while cur_index > 0 and arr[cur_index] < arr[cur_index - 1]:
temp = arr[cur_index - 1]
arr[cur_index - 1] = arr[cur_index]
Expand All @@ -30,8 +29,6 @@ def insertion_sort(arr):
return arr
Copy link

@grantreighard grantreighard Jan 17, 2019

Choose a reason for hiding this comment

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

I'm happy to say you got this one working, too. Maybe today you can work on quicksort in the recursive file. 😄



print(insertion_sort([22, 55, 77, 44, 66, 88, 11, 33]))

# STRETCH: implement the Bubble Sort function below


Expand Down