Name: Backtracking Algorith Type: Search algorithm / Divide and Conquer approach Description: It is used to search for any element in a sorted array. Compared with linear, binary search is much faster with a Time Complexity of O(logN), whereas linear search works in O(N) time complexity..