SAHAL01's blog

By SAHAL01, history, 15 months ago, In English

How to solve the problem below in O(log2n) C++: You have the i'th element of an unsorted array. you have to find the nearest(absolute difference of the values is as small as possible) element of the i'th element from the right side.

Full text and comments »

  • Vote: I like it
  • -1
  • Vote: I do not like it