Sequential Search
- It is easy.
- It needs not to be sorted.
- To search the last element we have element we to scan all the elements.
- If the element is first, then it’s best case bcoz the element is found at first position.


Binary Search
- It is complicated.
- It needs to be sorted.
- To search the last element we don't have to search all elements.
- If the element is first, then also we have to check for some of the elements (average case).