Share
Explore BrainMass

Generating an algorithm

Let T[1..n] be a sorted array of distinct integers, some of which may be negative. Give an algorithm that can find an index i such that 1 <= i <= n and T[i] = i, provided such an index exists. Your algorithm should take a time in Big "O" (log n) in worst case.

Solution Summary

This shows how to generate an algorithm to find index.

$2.19