• Placement Papers
• /
• DATA STRUCTURE
• /
• Programming
• /
• Technical

DATA STRUCTURE Question Papers:

(#M40019012) DATA STRUCTURE Programming question DATA STRUCTURE QUESTIONS Keep an EYE

Write a Binary Search program

Asked In DATA STRUCTURE (11 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (1)   (0) Submit Your Solution Technical

Read Solution (1) :

Mariappan  (10 years ago)

int binary_search(int A[], int key, int imin, int imax)
{
// continue searching while [imin,imax] is not empty
while (imax >= imin)
{
/* calculate the midpoint for roughly equal partition */
int imid = midpoint(imin, imax);

// determine which subarray to search
if (A[imid] < key)
// change min index to search upper subarray
imin = imid + 1;
else if (A[imid] > key)
// change max index to search lower subarray
imax = imid - 1;
else
// key found at index imid
return imid;
}
// key not found
return KEY_NOT_FOUND;
}

Is this solution Helpfull? Yes | No   

Please Login to Read Solution.