Computer Applications

What is the difference between linear search and binary search ?

Java Arrays

3 Likes

Answer

Linear Search	Binary Search
Linear search works on sorted and unsorted arrays.	Binary search works only on sorted arrays (both ascending and descending).
Each element of the array is checked against the target value until the element is found or end of the array is reached.	Array is successively divided into 2 halves and the target element is searched either in the first half or in the second half.
Linear Search is slower.	Binary Search is faster.

Answered By

3 Likes

Related Questions

Show the contents of the array after the second iteration of Selection Sort.
$\underset{0}{\boxed{12}}\underset{1}{\boxed{7}}\underset{2}{\boxed{2}}\underset{3}{\boxed{43}}\underset{4}{\boxed{11}}\underset{5}{\boxed{19}}\underset{6}{\boxed{1}}\underset{7}{\boxed{3}}\underset{8}{\boxed{35}}\underset{9}{\boxed{6}}$
View Answer

Show the contents of the array after the second iteration of Bubble Sort.
$\underset{0}{\boxed{35}}\underset{1}{\boxed{6}}\underset{2}{\boxed{8}}\underset{3}{\boxed{11}}\underset{4}{\boxed{15}}\underset{5}{\boxed{9}}\underset{6}{\boxed{7}}\underset{7}{\boxed{22}}\underset{8}{\boxed{41}}\underset{9}{\boxed{65}}$
View Answer
Given the following array :
$\underset{0}{\boxed{27}}\underset{1}{\boxed{23}}\underset{2}{\boxed{3}}\underset{3}{\boxed{18}}\underset{4}{\boxed{24}}\underset{5}{\boxed{1}}\underset{6}{\boxed{12}}\underset{7}{\boxed{60}}\underset{8}{\boxed{47}}\underset{9}{\boxed{5}}$
Which sorting algorithm would produce the following result after three iterations
$\underset{0}{\boxed{1}}\underset{1}{\boxed{3}}\underset{2}{\boxed{5}}\underset{3}{\boxed{18}}\underset{4}{\boxed{24}}\underset{5}{\boxed{27}}\underset{6}{\boxed{12}}\underset{7}{\boxed{60}}\underset{8}{\boxed{47}}\underset{9}{\boxed{23}}$
View Answer
Given the following array :
$\underset{0}{\boxed{13}}\underset{1}{\boxed{19}}\underset{2}{\boxed{6}}\underset{3}{\boxed{2}}\underset{4}{\boxed{35}}\underset{5}{\boxed{28}}\underset{6}{\boxed{51}}\underset{7}{\boxed{16}}\underset{8}{\boxed{65}}\underset{9}{\boxed{4}}$
Which sorting algorithm would produce the following result after three iterations.
$\underset{0}{\boxed{13}}\underset{1}{\boxed{6}}\underset{2}{\boxed{2}}\underset{3}{\boxed{19}}\underset{4}{\boxed{35}}\underset{5}{\boxed{28}}\underset{6}{\boxed{51}}\underset{7}{\boxed{16}}\underset{8}{\boxed{65}}\underset{9}{\boxed{4}}$
View Answer