what is a complexity of linear search,binery search?
- 10 Answers
- 37406 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Why is hashset used?
What is meant by arraylist?
Is radix sort stable?
Is it possible to store null key and null values in a hashmap?
What are the difference between arraylist and linkedlist from the perspective of sorting?
Is a hashset ordered?
Where is binary tree used?
In rdbms, explain what is the efficient data structure used in the internal storage representation?
Can we insert null in hashset?
How do you represent a linked list?
What do you mean by probing?
What is circular queue example?
What do you mean by open addressing?
Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.
Can array store heterogeneous data?
