If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions.

In this post, we will see how to find minimum element in sorted and rotated array.

#### Problem:

You are given an sorted and rotated array as below:

1 2 3 |
int arr[]={16,19,21,25,3,5,8,10}; |

If you note that array is sorted and rotated. You need to find minimum element in above array in o(log n) time complexity. You can assume that duplicates are not allowed in the array.

**💻 Awesome Tech Resources:**

- Looking for ⚒️ tech jobs? Go to our job portal.
- Looking for tech events? Go to tech events 🗓️ Calendar.️

#### Solution:

You can use variant of binary search algorithm to solve above problem. You can use a property that if you divide array into two sorted sub arrays ({16,19,21,25},{3,5,8,10} ), one will be sorted and other will have minimum element

#### Algorithm:

- Compute mid i.e low+high/2.
- Check if a[mid…high] is sorted
- Minimum lies in left part, so low=mid+1;

- Else
- Minimum lies in right part, so high=mid

### Java program to find minimum element in a sorted and rotated array :

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 |
package org.arpit.java2blog; public class MinimumElementSortedAndRotatedArrayMain { public static void main(String[] args) { int arr[]={16,19,21,25,3,5,8,10}; System.out.println("Minimum element in the array : "+findMinimumElementRotatedSortedArray(arr,0,arr.length-1,5)); } public static int findMinimumElementRotatedSortedArray(int[] arr,int low,int high,int number) { int mid; while(low<high) { mid=low + ((high - low) / 2); if(arr[mid] > arr[high]) { low=mid+1; } else { high=mid; } } return arr[low]; } } |

1 2 3 |
Minimum element in the array : 3 |