Diferente pentru blog/binary-search-shortlist intre reviziile #1 si #2
Nu exista diferente intre titluri.
Diferente intre continut:
Figure out an algorithm for each of the following problems. What’s the complexity? Code it.
* Given A, a sorted int array of length n. How many times the value x occur in A. * Given a real number x, find out it’s cubic root. * Given A a sorted array, find out an i such that A[i] == i.
