Is golden section search better than binary search?

Question

Recently I\'ve heard an opinion that binary search may be improved by taking by splitting the range by phi (golden ration) instead of by 2. This was a big surprise to me, becaus

Answer 1

"works faster" is vague; but binary search should have the lowest worst case bound for number of accesses.