Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40986 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Explain extended binary tree.
How to show internal storage representation of data structure in RDBM?
What is an recursive algorithm?
Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?
What is the logic to reverse the array?
Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.
What is the non linear data structure?
What is collision in data structure?
What do you mean by collision in hashing?
Write a Program for Insert in a sorted list
What are types of Collision Resolution Techniques and the methods used in each of the types?
What is the space complexity of selection sort?
What are the applications of stack?
What is data structure operations?
How dynamic arrays are created?
