Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-30 04:36:08 -04:00
Code Issues Packages Projects Releases Wiki Activity

Delete rotated_array.py

Browse Source
This commit is contained in:
marina 2023-08-07 22:31:10 -07:00 committed by GitHub
parent 79872f08eb
commit ff73b28ae7
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 0 additions and 46 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

46
searching/rotated_array.py
View File

@ -1,46 +0,0 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# author: bt3gl
def search(nums):
# 1. find the smallest element in the rotate array
# "left" will be used as index later
left, right = 0, len(nums)
while left < right:
mid = (left + right) // 2
if nums[mid] > nums[-1]:
left = mid + 1
else:
right = mid
# 2. write a binary search
def bs(left, right, target):
while left <= right:
mid = (left + right) // 2
if nums[mid] == target:
return mid
elif nums[mid] > target:
right = mid - 1
else:
left = mid + 1
return -1
# 3. run for both sides
response = bs(0, left, target)
if response != -1:
return response
else:
return bs(left, len(nums), target)