DifferenceModerate2 marks
What is the difference between the linear search and the binary search technique?
Topic: Linear search and binary search
Previous-year question practice database
Answer
Exam answer
The difference is shown in the table.
Explanation
Two differences carry the marks: the sorting requirement and the speed. Give both. The concrete illustration is worth adding: in a list of 1000 elements a linear search may need up to 1000 comparisons, while a binary search needs at most about 10, because each step throws away half the remaining data.
Comparison
| Linear search | Binary search |
|---|---|
| Can be applied to both sorted and unsorted lists. | Can be applied only to a sorted list. |
| Checks every element one after another from the beginning, so it is slower for large lists. | Repeatedly halves the search range, so it is much faster for large lists. |
More from Arrays
An array with 3 elements is arranged in ascending order as follows:
4 1 3 -> 1 4 3 -> 1 3 4
Name the technique used:2026The sales made by 5 salesmen selling 5 products is stored in a two-dimensional array of integer data type. How many bytes does the array occupy?2026int X[][] = {{4, 5}, {7, 2}, {19, 4}, {7, 4}};
Write the index of the maximum element and the index of the minimum element of the array.2026The following program segment swaps the first element and the second element of the given array without using the third variable. Fill in the blanks with appropriate java statements:
void swap()
{
int x[] = {4, 8, 19, 24, 15};
(1) __________;
(2) __________;
x[0] = x[0] / x[1];
System.out.println(x[0] + " " + x[1]);
}2026Write a program to accept the designations of 100 employees in a single dimensional array. Accept the designation from the user and print the total number of employees with the designation given by the user as input.
Example:
Trainee | Manager | Chef | Manager | Director | Manager
Input: Manager Output: 32026Write a program to accept a two-dimensional integer array of order 4 x 5 as input from the user. Check if it is a Sparse Matrix or not. A matrix is considered to be sparse if the total number of zero elements is greater than the total number of non-zero elements. Print appropriate messages.
Example:
4 3 0 1 0
1 0 0 2 0
1 0 1 0 0
0 3 2 0 0
Number of zero elements = 11
Number of non zero elements = 9
Matrix is a Sparse Matrix2026