Question

Advantages of binary search over sequential search

Answer 1

Answer:

Sequential Search  

Sorted list is not required.

It can be used in linked list Implementation.

It is suitable for a list changing very frequently.

The average number of comparison is very high.em

Binary search

Sorted list is required.

It cannot be used in liked list Implementation.

It is only suitable for static lists, because any change requires resorting of the list.

The average number of comparison is relatively slow.

Answer 2

Advantages of binary search over sequential search are:-

1) Binary search takes less time than sequantial search(linear search) as it compares with middle element and break the array into two equal parts.

2) Binary search is only works on sorted array.

Mark me brainlest@

Follow me