Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.
Answer Posted / akbar
binary search is faster than linear search.
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
How do I remove a value from a list?
What is placement new in data structures?
Write any two principles of gradation of structures.
What is meant by binary tree traversal?
Define disjoint set adt?
What is difference between while and do while?
Does hashmap sort automatically?
Is pointer a variable in data structure?
Is arraylist a class?
Explain linked list in short.
What is raid (redundant array of inexpensive disks)?
What is difference between treeset hashset linkedhashset?
Write the procedure to convert general tree to binary tree?
Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.
Explain binary search tree?