Estimate how many searches will be needed to justify time spent on presorting an array of 103...

Question

Estimate how many searches will be needed to justify time spent on presorting an array of 103 elements if sorting is done by merge sort and searching is done by binary search. (You may assume that all searches are for elements known to be in the array.) What about an array of 106 elements?

David · Accepted Answer

For merge sort, the average time complexity is given 
  T(n)  = O ( n log n ) 
For binary search, to search any element with ‘n’ nodes in the tree, the maximum number of 
searches is given by, 
  S(n) =O( log n) 
Thus, to search any element with pre-sorting, the time complexity C(n) is given by,

Estimate how many searches will be needed to justify time spent on presorting an array of 103 elements if sorting is done by merge sort and searching is done by binary search. (You may assume that all...

Solution

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment