So I'm taking an algorithms class, and part of this week's assignment is to compare the performance of 2 algorithms. I already implemented both of them (Kruskal's and Prim's algorithm for generating a minimum spanning tree), but I have no idea how to convince the cmd prompt to tell me how many processor cycles each program takes when against my sample input.
I think if you've got Vista there are some advanced system resources tools that you might be able to look at. I know there's super detailed stuff about memory and hard disk access on a process-by-process basis.
I'm on XP. When I programmed on Unix in college there was something I could throw at the front of the program from the command line that would tell me how many cycles it took. I'm not sure what else the prof would want me to do here.
Never mind. I just threw some basic timing in the program itself. Apparently C# will measure in "ticks" (whatever those are), and I can just compare those together. Should be close enough to see which algorithm is more efficient at any rate.
Posts
That's what I used in college. Is there a comparable function in WinXP (SP3 in case it matters)?
Feel free to lock this up, and thanks for help.