Discussion Board
Go to the previous messageThere are no next messages
Current Forum: 15-211 Main Forum
Date: Wed Dec 19 2001 5:31 pm
Author: Shi, Ying <shy@cmu.edu>
Subject: Re: merge sort O(nlogn)?
worst case for Merge-sort is still O(NlogN), it's quick-sort that has worst case as O(N*N)

Post response
Go to the previous messageThere are no next messages
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