Skip to main content

Posts

Showing posts from May, 2021

Binary search [Data structures]

Binary search is another technique of searching element/item/data in a list or array. In this technique it is mandatory that our given list or array should already be in a sorted manner(Ascending). Otherwise , this algorithm is failed at this situation. It follows divide and conquer approach.

Linear search [Data structures]

Linear search is a technique of searching elements in a list or array. As this name suggest linear, means a sequential searching in this we start searching our desired data/element from the start or initial stage of the list and this searching operation has been stopped at the end of the given list even our element is already found in between of the list it is a disadvantage of this technique but it deals with a unordered or unsorted list.