Showing posts with label Data Structures. Show all posts
Showing posts with label Data Structures. Show all posts
Saturday, October 15, 2011
Saturday, May 1, 2010
Which recursive sorting technique always makes recursive calls to sort subarrays that are about half size of the original array?
Answer: Mergesort always makes recursive calls to sort subarrays that are about half size of the original array, resulting in O(n log n) time.
What are the advantages and disadvantages of B-star trees over Binary trees?
Ans
A1 B-star trees have better data structure and are faster in search than Binary trees, but it’s harder to write codes for B-start trees.
A1 B-star trees have better data structure and are faster in search than Binary trees, but it’s harder to write codes for B-start trees.
Subscribe to:
Posts (Atom)
