#include <iostream>
using namespace std;
 
int main() {
	// Find minimum element in rotated array 
	cout<<"ENTER THE NUMBER,S OF ROTATION\n";
	int rot;
	cin>>rot;
	int arr[]={2,4,6,8,10};
	int size=5-1;
	int ans=arr[0];
	for(int i=0;i<rot;i++){
		int temp=arr[size];
		for(int j=size;j>0;j--){
 
			arr[j]=arr[j-1];
		}
		arr[0]=temp;
	}
 
	int start=0,end=size;
 
	while(start<=end){
 
		int mid=start+(end-start)/2;
 
		if(arr[0]<arr[mid]){
			start=mid+1;
		}else{
			ans=mid;
			end=mid-1;
		}
 
 
	}
	cout<<"minimum element in the array :"<<arr[ans];
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CgkvLyBGaW5kIG1pbmltdW0gZWxlbWVudCBpbiByb3RhdGVkIGFycmF5IAoJY291dDw8IkVOVEVSIFRIRSBOVU1CRVIsUyBPRiBST1RBVElPTlxuIjsKCWludCByb3Q7CgljaW4+PnJvdDsKCWludCBhcnJbXT17Miw0LDYsOCwxMH07CglpbnQgc2l6ZT01LTE7CglpbnQgYW5zPWFyclswXTsKCWZvcihpbnQgaT0wO2k8cm90O2krKyl7CgkJaW50IHRlbXA9YXJyW3NpemVdOwoJCWZvcihpbnQgaj1zaXplO2o+MDtqLS0pewoJCQkKCQkJYXJyW2pdPWFycltqLTFdOwoJCX0KCQlhcnJbMF09dGVtcDsKCX0KCQoJaW50IHN0YXJ0PTAsZW5kPXNpemU7CgkKCXdoaWxlKHN0YXJ0PD1lbmQpewoJCQoJCWludCBtaWQ9c3RhcnQrKGVuZC1zdGFydCkvMjsKCQkKCQlpZihhcnJbMF08YXJyW21pZF0pewoJCQlzdGFydD1taWQrMTsKCQl9ZWxzZXsKCQkJYW5zPW1pZDsKCQkJZW5kPW1pZC0xOwoJCX0KCQkKCQkKCX0KCWNvdXQ8PCJtaW5pbXVtIGVsZW1lbnQgaW4gdGhlIGFycmF5IDoiPDxhcnJbYW5zXTsKCXJldHVybiAwOwp9

MQ==

1