Calculate Big O, quick/mergesort C++
I know in theory what Big O should be but I need to prove it by having having a counter of some sort perhaps.
I set a global counter called count and use it to try and approximate Big O over a series of runs.
my code : http://pastie.org/892390
I put in a counter as is, but it is incorrect. Assignment was already due which is why I just threw it in just to have something...but now I'm curious as to how it would actually work.
Please help.
I set a global counter called count and use it to try and approximate Big O over a series of runs.
my code : http://pastie.org/892390
I put in a counter as is, but it is incorrect. Assignment was already due which is why I just threw it in just to have something...but now I'm curious as to how it would actually work.
Please help.
Topic archived. No new replies allowed.