Question

compare linear search & binary search

Answer 1

Answer:

A linear search looks down a list, one item at a time, without jumping. ... A binary search is when you start with the middle of a sorted list, and see whether that's greater than or less than the value you're looking for, which determines whether the value is in the first or second half of the list.

pls mark my ans as brainliest

Answer 2

Answer:

Explanation:

Linear search sequentially compares one element with entire array,where as in binary,array is divided into halves.In binary, array has to be sorted.But,in linear array can be unsorted.Time complexity is low in binary but very high in linear.

Hope you understood.