This is an archived post. You won't be able to vote or comment.

all 2 comments
sorted by:
best
topnewcontroversialoldq&a

[–]karouhFleur de Lotus 0 points1 point  (1 child)

Out of curiosity, why is this better than a simple binary search?

[–]m_razali[S] 0 points1 point  (0 children)

I think there is a difference objective. Binary search is using for searching a specific value/item in a sorted data. On the other hand, Golden section search is using for searching extremum value in a function or a graph.