The primary goal of our investigation was to compare the search algorithms on the basis of 'binary search' algorithm. We chose three algorithms - binary search, or dichotomy, golden section algorithm and Fibonacci search, and tested them in our application in the programming language C#. We compared algorithms by the amount of processor CPU cycles (ticks) which algorithm used to find a required element in unsorted array o f random elements, and found the best algorithm for this task
