Skip to content

homework 17 #14

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

Merged
z2labplus merged 1 commit into from
Oct 28, 2018
Merged

homework 17 #14

Show file tree
Hide file tree
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
1 change: 1 addition & 0 deletions .gitignore
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,3 +1,4 @@
package-lock.json
.vagrant
.vscode
.next
Expand Down
26 changes: 26 additions & 0 deletions algorithm/search/binary_search.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -103,3 +103,29 @@ def binary_search_last_lte(items, val):
else:
low = mid + 1
return False


def homework17(array, value):
'''
https://time.geekbang.org/column/article/42733
课后习题
'''
low = 0
high = len(array) - 1
while low <= high:
mid = low + ((high - low) >> 1)
if value == array[low]:
return low
if value == array[high]:
return high
if value == array[mid]:
return mid
if value > array[mid] and value > array[high] and array[mid] < array[low]:
high = mid - 1
elif value < array[mid] and value < array[low] and array[mid] < array[low]:
high = mid - 1
elif value < array[mid] and value > array[low]:
high = mid - 1
else:
low = mid + 1
return False