Unformatted text preview: 4-3 5-2-1 2 6-2 Question 2 : Suppose you are given an increasing sequence of n distinct in-tegers in an array A [1 ..n ]. Design an eﬃcient algorithm to determine whether there exists an index i such that A [ i ] = i . Justify the correctness of your algorithm and analyze its running time. 1...
View Full Document
- Spring '07
- Algorithms, Big O notation, Analysis of algorithms