[SOLVED] Why is binary search slower than linear search for a list of 100 binary sorted numbers? | Sololearn: Learn to code for FREE!
New course! Every coder should learn Generative AI!
Try a free lesson
+ 7

[SOLVED] Why is binary search slower than linear search for a list of 100 binary sorted numbers?

So here I am finding the total number of 1's in list using binary search and linear search .For small input (100) ,why is that binary one is slower ,am i implementing it wrong way ? https://code.sololearn.com/c2V2cJ3ZvKsa/?ref=app

27th Jun 2020, 12:54 PM
Abhay
Abhay - avatar
8 Answers
+ 4
From wikipedia: Binary search is faster than linear search except for small arrays. https://en.m.wikipedia.org/wiki/Binary_search_algorithm
27th Jun 2020, 1:12 PM
Denise Roßberg
Denise Roßberg - avatar
+ 2
Robin thanks a lot for providing a detailed and a clear explanation of how it works and what I was doing wrong ,now i understand it much better
27th Jun 2020, 4:10 PM
Abhay
Abhay - avatar
+ 1
I read that it is slower for small arrays but why so? Aren't less operations performed for binary search!! like it divides the list into two half ,check condition and loop continues and if a element is at 50th position, loop will run 5-6 times while in linear one it just checks condition and loop continues and if a element is at 50th position ,Loop will run 49 times
27th Jun 2020, 1:29 PM
Abhay
Abhay - avatar
+ 1
Binary search is faster than linear search without any doubt, with a O(log n) runtime complexity. On the other hand linear search has complexity of O(n) - or linear time complexity Note those big O notations specifies the worst the algorithm can go for, so if you linear searched 1 in this list [1, 2, 3] it will be faster than other method for sure. But again those Big O notations specifies the worst it can do, which may be the answer you looking for
27th Jun 2020, 2:24 PM
Seniru
Seniru - avatar
+ 1
Thks Martin Taylor ,but I don't get it how is linear search fast ,like for a list of 100 ,if first 50 are zeroes ,then Loop will run 50 times but in binary search the loop will run only 6 times,shudn't it be faster if I am not thinking wrong ,but there are other operations as well being performed in binary search like checking for if conditions ,dividing array into two two subarrays,and finding mid element ,so all that slows down binary search? Also if you run this binary search for list with numbers like 1000 and above it performs better than linear search
27th Jun 2020, 3:24 PM
Abhay
Abhay - avatar
0
I guess you need to understand Big O notation. But I am not completely sure.
27th Jun 2020, 1:55 PM
Denise Roßberg
Denise Roßberg - avatar
0
Robin how are you able to type long answers? I am not able to type half of that. Sololearn gives a character limit for my device
29th Jun 2020, 9:38 AM
Ore
Ore - avatar
0
Robin Ah. I see
29th Jun 2020, 2:58 PM
Ore
Ore - avatar