From faae8bf474447ff956728c60f7d01ee1a1c0fc04 Mon Sep 17 00:00:00 2001 From: unknown Date: Wed, 27 Aug 2025 16:41:25 -0500 Subject: [PATCH] missing element in a sorted array --- mock1.py | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 mock1.py diff --git a/mock1.py b/mock1.py new file mode 100644 index 00000000..2f6efd7b --- /dev/null +++ b/mock1.py @@ -0,0 +1,29 @@ +def BinarySearch(nums): + low=0 + high=len(nums)-1 + + while(low<=high): + mid=low+(high-low)//2 + if nums[mid] == mid+1: + low=mid+1 + else: + high=mid-1 + + return low+1 + +nums=[1,2,3,4,6,7,8] +print(BinarySearch(nums)) + +# l=0 +# h=6 +# m=3 -->4==4 +# l=3 +# h=6 +# m=4 -->7==6 +# l=3 +# h=3 l=h return 5 +# Time Compexity: O(logn) +czzzzzzzzzzzzzzz + + +