Binary search is not applicable in the following cases:

1. Unsorted Data: Binary search is not applicable on unsorted data. It is a prerequisite for binary search that the data must be sorted, either in ascending or descending order. If the data is not sorted, binary search cannot be applied.

2. Dynamic Data: Binary search is not suitable for data that is dynamically changing. If the data set is frequently updated (insertions or deletions), maintaining the sorted order of the data becomes expensive.

3. Large Data: If the data set is too large to fit into the main memory, binary search may not be applicable. This is because binary search requires random access to data, and accessing data not in main memory is time-consuming.

4. Sequential Access Data: Binary search is not applicable on data structures that provide only sequential access to their elements, like linked lists. This is because binary search requires direct access to any element in constant time, which is not possible in such data structures.

Question

Binary search is not applicable in the following cases:

1. Unsorted Data: Binary search is not applicable on unsorted data. It is a prerequisite for binary search that the data must be sorted, either in ascending or descending order. If the data is not sorted, binary search cannot be applied.

2. Dynamic Data: Binary search is not suitable for data that is dynamically changing. If the data set is frequently updated (insertions or deletions), maintaining the sorted order of the data becomes expensive.

3. Large Data: If the data set is too large to fit into the main memory, binary search may not be applicable. This is because binary search requires random access to data, and accessing data not in main memory is time-consuming.

4. Sequential Access Data: Binary search is not applicable on data structures that provide only sequential access to their elements, like linked lists. This is because binary search requires direct access to any element in constant time, which is not possible in such data structures.

Knowee AI · Accepted Answer

Binary search is not applicable in the following cases:

1. Unsorted Data: Binary search is not applicable on unsorted data. It is a prerequisite for binary search that the data must be sorted, either in ascending or descending order. If the data is not sorted, binary search cannot be applied.

2. Dynamic Data: Binary search is not suitable for data that is dynamically changing. If the data set is frequently updated (insertions or deletions), maintaining the sorted order of the data becomes expensive.

3. Large Data: If the data set is too large to fit into the main memory, binary search may not be applicable. This is because binary search requires random access to data, and accessing data not in main memory is time-consuming.

4. Sequential Access Data: Binary search is not applicable on data structures that provide only sequential access to their elements, like linked lists. This is because binary search requires direct access to any element in constant time, which is not possible in such data structures.

In which case is binary search not applicable?

Question

Solution

Similar Questions

Upgrade your grade with Knowee