| Current Forum: 15-211 Main Forum |
| Date: Mon Dec 17 2001 10:35 pm |
| Author: White, David <white3@andrew.cmu.edu> |
| Subject: Re: BIG O QUESTION |
|
|
Thats true. Take for instance sorting. Mergesort has
a worst case of O(NlogN), but in practice runs about O(NlogN),
while quicksort has a worst case of O(N^2) and in practice runs about O(NlogN) but it is very optimized and will beat mergesort most of the time, hence most people use quicksort...
Right? |
|