Interested to Buy Any Domain ? << Click Here >> for more details...
Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.
- 22 Answers
- 46864 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / p.divya poojitha
binary search is faster than sequential searching.in
sequential searching the desired record is 4000 if u search
that record can be done with 1....4000 so it takes large
time for searching compare complexities of both searching
meathods are
binary search O(logn)
sequential search O(n)
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
When new data are to be inserted into a data structure?
How to reverse singly link list?
How does arraylist size work?
Explain the Array
Explain the Linked List
How many types of arrays are there?
Is hashmap sorted?
What is difference between an Array and ArrayList?
What is a directed graph?
Can we search the data in a linked list?
Define terminal nodes in a tree?
Is quicksort divide and conquer?
Which data structure is used to perform recursion?
What is the difference between data types and data structures?
Why is data structure?
