Get Time
Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings
View: Flat  | Threaded  | Tree
Previous Thread  |  Next Thread
Regarding Merge Sort | Reply
Running time of merge sort is O(nlgn)and i am continuosly breaking my array into smaller sub arrays,what if I stop this recursive procedure upto some depth(of the recurrence tree) and then individually apply insertion sort on those sub arrays.Let us assume we got k sublists and total number of numbers in each of these sublists will be n/k, running time will be greatly reduced(as compared to normal procedure of merge sort) if these k sublists are already sorted.But how to choose this value of k so that we can generate efficient code?
Subject Author Date
Regarding Merge Sort cnitin_ice Sep 27, 2006 at 3:02 AM EDT
Re: Regarding Merge Sort darko_aleksic Sep 27, 2006 at 9:19 AM EDT
Re: Regarding Merge Sort dskloet Sep 27, 2006 at 5:42 PM EDT
Re: Regarding Merge Sort Insight Sep 28, 2006 at 12:22 AM EDT
Re: Regarding Merge Sort Larry Sep 28, 2006 at 9:46 AM EDT