Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40979 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Define adjacent nodes?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
What actions are performed when a function is called?
What is a data structure node class?
How are elements stored in hashset?
How do you sort an array in decreasing order?
What is binary tree give example?
How do you make a bubble chart with 3 variables?
How would you check if a binary tree is BST or not ? Write a program.
Does concat mutate array?
What are the complexity of binary search?
What is the difference between null and void pointer in data structures?
What do you mean by articulation point?
Tell me can the size of operator be used to tell the size of an array passed to a function?
Is hashset synchronized?
