Discussion Board
Go to the previous messageGo to the following message
Current Forum: 15-211 Main Forum
Date: Wed Dec 19 2001 5:05 pm
Author: Lee, Charles C. <chucklee@cmu.edu>
Subject: Re: merge sort O(nlogn)?
I think the question asks for worst case. O(nlog n) is average.
Post response
Go to the previous messageGo to the following message
Current Thread Detail:
merge sort O(nlogn)?      White, David      Wed Dec 19 2001 10:53 am       
Re: merge sort O(nlogn)?      Lee, Charles C.      Wed Dec 19 2001 5:05 pm       
Re: merge sort O(nlogn)?      Shi, Ying      Wed Dec 19 2001 5:31 pm       
Back to previous screen