LogFAQs > #940941356

LurkerFAQs, Active DB, DB1, DB2, DB3, DB4, DB5, Database 6 ( 01.01.2020-07.18.2020 ), DB7, DB8, DB9, DB10, DB11, DB12, Clear

Topic List	Page List: 1
Topic	What is the numerical average number of comparisons in a quicksort (not Big O)
Eevee-Trainer 06/19/20 8:08:57 PM #2:	You're not going to get an exact answer since it depends on your data set and your implementation. You can treat f(x) = O(g(x)) as an approximation of sorts for particular x anyways, which makes sense from the limit definition. For instance, a quick Google search says you can on average expect O(n log n) operations. So for 100 items, you can expect roughly 100 log(100) 461 operations. --- My Social Discord Server, Eevee's Mystery Dungeon: https://discord.gg/emd My PMD Rescue Server: https://discord.gg/E57gMQq <cite>Eevee-Trainer posted [p:940941356] in What is th... [t:78786095]...</cite> <quote>You're not going to get an exact answer since it depends on your data set and your implementation. You can treat f(x) = O(g(x)) as an approximation of sorts for particular x anyways, which makes sense from the limit definition. For instance, a quick Google search says you can on average expect O(n log n) operations. So for 100 items, you can expect roughly 100 log(100) 461 operations. --- My Social Discord Server, Eevee's Mystery Dungeon: https://discord.gg/emd My PMD Rescue Server: https://discord.gg/E57gMQq</quote> ... Copied to Clipboard!
Topic List	Page List: 1