what is a complexity of linear search,binery search?
- 10 Answers
- 38991 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
What is data structure and why we need it?
What data type is enum?
Tell us the difference between merge and quick sort. Which one would you prefer and why?
What is the difference between a Stack and a Queue.
What is time and space complexity of bubble sort?
What is the use of tree data structure?
How do you declare An array of three char pointers
What is a string array?
Define hashing?
Define binary tree insertion.
What are linked lists most commonly used for?
Which sorting algorithm is best for small data?
How do signed and unsigned numbers affect memory?
Define a relation?
Write a recursive c function to calculate the height of a binary tree.
