| Topic List | Page List: 1 |
|---|---|
| Topic | What is the numerical average number of comparisons in a quicksort (not Big O) |
| joe40001 06/19/20 7:33:04 PM #1: | I want to apply it to get the expected value of a number of comparisons of a list of size n, but I know n log n is not exactly right. So what is it? For example, I highly doubt a list of 100 will have on average 200 comparisons. Is it n ln n? Is it n logbase2 n? Is it 2n ln 4n? How fast it scales is useless to me in me trying to get a practical example. I can't for the life of me find a google result that isn't just telling me the big o result which of course everybody knows. --- "joe is attractive and quite the brilliant poster" - Seiichi Omori https://imgur.com/TheGsZ9 ... Copied to Clipboard! |
| Topic List | Page List: 1 |