Originally posted by Quell
Hey.
For my problem above wiht the numbers fo 19 and 0.25 ms...they changed from 6 and 3 ms respectivly...i am not sure what i did and why it happended.....here is a list of changes that i made....
-the speed test is inside of 2 functions....i changed the return type of the functin (from void to double on both).
-i use a parameter list instead of global variables from main.
-i used typdefenition for stuff like unsinged short -> US.
i do wanna change evrything back becuase of amount of code needed to be changed.
I amnot quite following you...What exactly are you asking ? Does the speed you mean get faster when there is such a change ? I don't know whether you are implementing qsort algorithm for its complexity purpose only or something else...Are you using it with template for dealing with different runtime types input from the users ?
P.S. Mialno, the link that was givven has several testes posibiliies...i think that the QueryPerformance counter is the best...becuase the RDSTC(something like that) is not supported on all cpus....and Query is much easier to use.
Just an opinion.
Thanks a lot, I see your points here....(lol) Thanks....

-Milano