Design and analyze an algorithm that searchs for an element x in a sorted table A(with n elements), so that its complexity is O(logD). D stands for distance, counting the amount of elements between the first element and the element x in table A. Simpler, D is the position of the element x in the sorted table A.
1 Year Ago
Related Article:Radix sort
is a C++ discussion thread by aaal that has 1 reply and was last updated 6 months ago.