How to find the maximum element of an unsorted array in O(log n)?

Правка en1, от Closed_, 2021-09-29 11:53:47

Hi everyone!

Does there an algorithm find the maximum element of an unsorted array in o(log n), and what about a bitonic array? I searched for this but have not found any solution to this problem!

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Closed_ 2021-09-29 11:53:47 265 Initial revision (published)