Diferente pentru blog/binary-search-shortlist intre reviziile #4 si #5

Nu exista diferente intre titluri.

Diferente intre continut:

# 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.
# Given the +,-,*,/,sqrt operations and a real number x find an algorithm to get log2x.
# Given an array A such that A[0] > A[1] and A[n-1] > A[n-2] find out a local minimum (find out an i such that A[i-1] > A[i] < A[i + 1]).
# Given an array A such that A[ 0] > A[ 1] and A[n-1] > A[n-2] find out a local minimum (find out an i such that A[i-1] > A[i] < A[i + 1]).
# Let A be a sorted array with distinct elements. A is rotated k positions to the right (k is unknown). Find out k.
# Let A be a sorted array with distinct elements. A is rotated k positions to the right (k is unknown). Find out if A contains a number x.
# Given two sorted arrays of length n and m, find out the kth element of their sorted union.

Nu exista diferente intre securitate.

Topicul de forum nu a fost schimbat.