Question

write difference between Linear Search and Binary Search.

Answer 1

	Linear Search	Binary Search
1	Linear search performs on unsorted list of elements as well as sorted list.	For binary search, the elements in array are stored in  alphabetically or numerically in sorted manner.
2	Compare the desired element with all elements in an array until the match is found.	Compare the value of midpoint with desired value. If the value is greater than midpoint value, the first half is checked, otherwise second half checked until search is successful or interval empty.
3	Insertion of an element in an array can be performed very efficiently when array is not ordered.	An insertion of a new element requires that many elements be physically moved to preserved order.
4	For large size of array, time required for this search is very larger.	For large size of array, comparatively time required is less.
5	Time complexity is as follows : Worst case : N comparison Best case : 1 comparison	Time complexity as follows: Worst case : log2 N comparison Best case : 1 comparison