Find Minimum in Rotated Sorted Array

[hsayvaidya23]

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become:

[4,5,6,7,0,1,2] if it was rotated 4 times. [0,1,2,4,5,6,7] if it was rotated 7 times. Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-2]].

Given the sorted rotated array nums of unique elements, return the minimum element of this array.

You must write an algorithm that runs in O(log n) time.

[sahilbheke]

Hello @hsayvaidya23 want to work on this issue and it's my first time in open source but not in programming. So, Can you help with this.

[Shiwani5]

Hi Sir, I Hope you are doing well. As this is my first time participating in the open source challenge, I know the most optimized solution for this code. Please permit me to solve this problem.

[harshsingh32]

Please assign this issue to me under hacktoberfest23.