CareerCup

int max(int *a,int start,int end))
{
int mid=(start+end)/2;
if(a[mid-1]<a[mid] && a[mid]<a[mid+1])//mid falls in increasing series
return(max(a,mid+1,end));//search in next half
elseif((a[mid-1]>a[mid] && a[mid]>a[mid+1])//mid falls in decreasing series
return(max(a,start,mid-1));//search in previoushalf
else return a[mid];
}

Need to add enough checks for underflow & overflow.

FInd the size and traverse to the middle count.
Ex: if array[]={...}
cnt = sizeof(array)/sizeof(array[0]);

then, compare to cnt-1 and cnt+1 members of array and proceed till you find the lartest number in the array.

public class SearchMaxHiLoArray {

	private int splitIndex(int start, int end){
		return start + (end-start)/2;
	}
	public int max(int[] array){
		return max(array, 0, array.length);
	}
	private int max(int[] array, int start, int end){
		int split = splitIndex(start, end);
		if(split==(array.length-1) || split==0) return array[split];
		if(1 == (end-start)) return array[end];
		
		if(array[split] < array[split+1]){
			return max(array, split, end);
		} else if(array[split] > array[split+1]){
			return max(array, start, split);
		}
		return array[split];
	}
}

#include<stdio.h>
#include<stdlib.h>

int max(int a[],int i,int j)
{
if(i<j)
{
int mid=(i+j)/2;

if(j-i ==1 ) /* only two element*/
return (a[i]>a[j] ? a[i]:a[j]);

if(mid-1 >= i && mid+1 <=j) /* at least 3 element*/
{

if(a[mid]>=a[mid-1] && a[mid+1] <= a[mid])
return a[mid];
else if(a[mid] >a[mid+1])
return max(a,i,mid);
else
return max(a,mid,j);
}
}
return -1;
}

int main()
{
int a[]={1,3,6,8,77,89,78,67,56,45,34,23,12,9,8,7,6,5,4,3,2,1};

printf("%d",max(a,0,21));

return 0;
}

Small correction in above code if

if(i==j)
return a[i];

Guys kindly also post what the logic behind the code.This would be more helpfull as many know cpp and not java or the other way

#include <iostream>
using namespace std;

int max(int a[], int n)
{
    int i, flag =0;
    if(n == 1)
    return a[0];
    for(i=0; i<n-1; i++)
    {
         if(a[i] > a[i+1])
         {
            flag =1;     
            return a[i];
         }
    }
    if(!flag)
    return a[n-1];
}

int main()
{
    int arr[] = {1,3,6,8,77,99,99,78,67,56,45,34,23,12,9,8,7,6,5,4,3,2,1};
    int a[] = {1,3,6,8,77,89};
      cout<<"Maximum Element in 1st Array is  "<<max(arr, 23)<<endl;
    cout<<"Maximum Element in 2nd Array is  "<<max(a, 6);
    getchar();
    return 0;
} 

/* 
The logic behind this program is that -- Once you encounter an element that is greater than its next 
element then you found the max element (as was given in the question that is in decresing order from there)
Please let me know if I misunderstood anything
*/

how about this
while(a[i]<a[i+1])
i++;
printf("%d",a[i]);

how about this?

while(a[i]<a[i+1])
i++;
printf("%d",a[i]);