How is linear search different from binary search?

1.	How is linear search different from binary search?
Answer» 1. Binary search requires the input data to be sorted near search doesn’t. 2. Binary search requires an ordering comparison; linear search only requires equality comparisons 3. Binary search has complexity 0(log n); linear search has complexity O(n) as discussed earlier. 4. Binary search requires random access to the data; linear search only requires sequential access (this can be very important – it means a linear search can stream data of arbitrary size).

Answer»

1. Binary search requires the input data to be sorted near search doesn’t.

2. Binary search requires an ordering comparison; linear search only requires equality comparisons

3. Binary search has complexity 0(log n); linear search has complexity O(n) as discussed earlier.

4. Binary search requires random access to the data; linear search only requires sequential access (this can be very important – it means a linear search can stream data of arbitrary size).

Discussion

No Comment Found

Related InterviewSolutions

Accept a list containing integers randomly. Accept any number and display the position at which the number is found in the list.
For a given list of values in descending order, write a method in Python to search for a value with the help of Binary search method. The method should return position of the value and should return -1 if the value not present in the list.
What will be the status of the following list after the First, Second and Third pass of the selection sort method used for arranging the following elements in descending order? Note : Show the status of all the elements after each pass very clearly underlining the changes. 12,14, -54,64,90,24
How is linear search different from binary search?

How is linear search different from binary search?

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment