Question

Can anyone tell me about binary search and linear search major difference ...Plz tell these who not only...

Answer 1

Difference Between Linear Search and Binary Search. ... Searching is a process of finding an element within the list of elements stored in any order or randomly. The major difference between linear search and binary search is that binary search takes less time to search an element from the sorted list of elements

Answer 2

$<font color="red"><h1>HELLO FRIEND</h1></font> <b><font color="green"><marquee>Here is your answer.</marquee></font></b><hr size=3 color="blue"> <b><center>DIFFERENCE BETWEEN LINEAR SEARCH AND BINARY SEARCH</CEnter></b> Linear search and binary search are the two methods which are used in arrays for searching the elements. Searching is a process of finding an element within the list of elements stored in any order or randomly. <b>Major difference</b> between linear search and binary search is that binary search takes less time to search an element from the sorted list of elements. So it is inferred that efficiency of binary search method is greater than linear search. Another difference between the two is that there is a prerequisite for the binary search, i.e., the elements must be sorted while in linear search there is no such prerequisite. <hr size=3 color="green"><font color=#800080> <b>HOPE IT HELPS<BR>PLEASE MARK IT AS A BRAINLIEST ANSWER<BR>PLEASE FOLLOW ME</b><BR><BR></font><font color="red"><b>About me: </b><I>Shivam shaurya$