Example are on Github repo https://github.com/Stopaloglu16/LearningCsharp/tree/master/Src/AdvancedTopics/DataStructures
Looking for a specific book on a shelf by checking each book one by one until you find the desired one.
Best case O(1), worsts O(n)
It works by repeatedly dividing the search interval in half until the target value is found
Finding a name in a phonebook by repeatedly dividing the search space in half.
O(log N)