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
Are data structures important?
Is binary tree balanced?
What is a treemap chart?
How to sort an Array?
What are the advantages of linked list?
Is radix sort stable?
Define internal nodes?
What do you mean by primary clustering?
What do you mean by Logical Error
What data structure does a binary tree degenerate?
How do you perform a merge sort?
Define static data structures?
What is difference between an Array and ArrayList?
Which sorting is worst?
Can we define the size of arraylist?