fork(1) download
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5. // Find minimum element in rotated array
  6. cout<<"ENTER THE NUMBER,S OF ROTATION\n";
  7. int rot;
  8. cin>>rot;
  9. int arr[]={2,4,6,8,10};
  10. int size=5-1;
  11. int ans=arr[0];
  12. for(int i=0;i<rot;i++){
  13. int temp=arr[size];
  14. for(int j=size;j>0;j--){
  15.  
  16. arr[j]=arr[j-1];
  17. }
  18. arr[0]=temp;
  19. }
  20. int ans2;
  21.  
  22. int start=0,end=size;
  23.  
  24. while(start<=end){
  25.  
  26. int mid=start+(end-start)/2;
  27.  
  28. if(arr[0]<arr[mid]){
  29. start=mid+1;
  30. }else{
  31. ans2=arr[mid];
  32. end=mid-1;
  33. }
  34.  
  35.  
  36. }
  37. cout<<"minimum element in the array :"<<ans2;
  38. return 0;
  39. }
Success #stdin #stdout 0s 5320KB
stdin
1
stdout
ENTER THE NUMBER,S OF ROTATION
minimum element in the array :10