BinarySearch Takes a sorted list and searches for an element in it in an average time complexity of O(logn)