what is a complexity of linear search,binery search?
Answers were Sorted based on User's Feedback
Answer / geetika sharma
No, Above answer is wrong. The complexity of Linear search
is O(n) and
Binary search is O(log n) at the base 2
Is This Answer Correct ? | 212 Yes | 9 No |
Answer / saurabh teotia
the complexity of linear search is o(n) n that of binary search is o(logn)
Is This Answer Correct ? | 66 Yes | 5 No |
Answer / guest
in linear search each element in the array should be checked
until the required element got searched whereas in binary
search array is divided into two and required element is
searched
Is This Answer Correct ? | 28 Yes | 1 No |
Answer / lokesh bhatt
o(n)= linear
o(log n)(base 2)= binary
bcz in linear v search one be one while in binary v divide array in two part every time
Is This Answer Correct ? | 15 Yes | 4 No |
Answer / pratik wavhal
For Linear Search Complexity Is :- O(n).
For Binary Search Complexity Is :- O(log(at base 2)n).
Is This Answer Correct ? | 8 Yes | 4 No |
Answer / shailja thakur
oops........u all guys are duffers ....u have to clear your all concepts..but u can't....bt better luck for next time...go back to your study and work hard .and right answer is 0..:P
Is This Answer Correct ? | 5 Yes | 6 No |
Answer / naresh kumar
complexity of linear search 0
n binary search 0log(n)
Is This Answer Correct ? | 14 Yes | 31 No |
Answer / hemant belwal
linear search=n/2
binary search=iog2n,2 in the base of log.
Is This Answer Correct ? | 36 Yes | 91 No |
What is collection sort?
What is the average number of comparisons in a sequential search?
What are the advantages of array?
How is it possible to insert different type of elements in stack?
Define an algorithm. What are the types of algorithms?
Why do we use binary search?
Does treemap allow null key?
Write a program to reverse a link list.
difference between the run time polymorphism and compile time poly morphism and about virtual function.
2 Answers CybAge, Innowe, TCS, Wipro,
What is a stable sorting algorithm?
What are the types of bulleted list?
How do you clear a stack?