Ayush Shukla

This will execute in O(log(N)) time where N is the size of array and it will use constant space size ,but binary search with recursion uses O(log(N)) stack size. the code #include <iostream> using namespace std; int main()  {     int a[] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14};    int n = sizeof(a)/sizeof(a[0]);  int i = 0;  int j = n-1;  int x=12,f=0;     while(i<=j)    {      if(i==j && a[i] == x)      {      cout<< " found " <<a[i] << " at " <<i;      f =1;      return 0;      }            int mid = (i+j)/2;            if(a[mid]  == x)      {      cout << " found " <<a[mid] << " at " <<mid;      f=1;   ...

Calculate the power of an element(x,y) where x is base and y is power in O(log(y)) times. with O(1) space complexity without using DIVIDE & Conquer !!                                                                                                                                                                                                                                             C++ program for...