| Current Forum: 15-211 Main Forum |
| Date: Wed Dec 19 2001 10:53 am |
| Author: White, David <white3@andrew.cmu.edu> |
| Subject: merge sort O(nlogn)? |
|
|
Q 8 part c for test Fall 99, the answer
key seems to indicate that merget sort is O(n^2)?
The book says O(nlog(n))... |
|