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
iterative binary search completed
  • Loading branch information
@Hunter315
Hunter315 committed Jan 17, 2019
commit 9f58fc5407aac066f03b1a777be2caad3eda9522
11 changes: 11 additions & 0 deletions project/searching.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -12,13 +12,24 @@ def linear_search(arr, target):
# STRETCH: write an iterative implementation of Binary Search
def binary_search(arr, target):


if len(arr) == 0:
return -1 # array empty

low = 0
high = len(arr)-1

# TO-DO: add missing code
low = 0
high = len(arr) - 1
while low <= high:
mid - low + (high - low) // 2
mid_val = arr[mid]
if mid_val == target:
return mid
elif mid_val < value:
low = mid + 1
else: high = mid - 1

return -1 # not found

Expand Down