Skip to content

Hunter Smith - Sorting #1

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

Hunter Smith - Sorting #1

Changes from 1 commit
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
8e4d832
insertion_sort in iterative sorting complete
Hunter315 Jan 16, 2019
227df8b
fixed typo in insertion sort
Hunter315 Jan 16, 2019
6d8b580
selection_sort complete
Hunter315 Jan 16, 2019
b0fa7fc
bubble sort complete
Hunter315 Jan 16, 2019
1fd5bdf
linear search completed
Hunter315 Jan 17, 2019
9f58fc5
iterative binary search completed
Hunter315 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
selection_sort complete
  • Loading branch information
@Hunter315
Hunter315 committed Jan 16, 2019
commit 6d8b580ad39f19b2806d287a5dcc443c5f7f395f
8 changes: 6 additions & 2 deletions project/iterative_sorting.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,12 +6,16 @@ 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, len(arr)):
if arr[j] < arr[smallest_index]:
smallest_index = j



# TO-DO: swap

temp = arr[smallest_index]
arr[smallest_index] = arr[cur_index]
arr[cur_index] = temp



Expand Down