Similar to Ternary Search

Правка en3, от 314rate, 2018-08-25 14:30:17

Hello!

For finding the minimum with Ternary Search we nead a function that respects this conditions :

for all a,b with A ≤ a < b ≤ x, we have f(a) < f(b), and

for all a,b with x ≤ a < b ≤ B, we have f(a) > f(b).

Is there an algorithm ( also running in logaritmic time ) for finding the minimum in a function like this :

for all a,b with A ≤ a < b ≤ x, we have f(a) <= f(b), and

 for all a,b with x ≤ a < b ≤ B, we have f(a) >= f(b).

Thank You!

Теги ternary search

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский 314rate 2018-08-25 14:30:17 0 (published)
en2 Английский 314rate 2018-08-25 14:21:35 14 (saved to drafts)
en1 Английский 314rate 2018-08-25 14:21:10 498 Initial revision (published)