how can solve this?

Question

how can write program that can find running time of bubble sort, insertion sort, heap sort, merge sort and quick sort?

In C++ plz

LOL.. it is not homework but it help me to find running time to any sort.
I understand running time but I have no idea how to write the code?

Answer 1

Why not just run each 5000 times, and note the before and after times?

Answer 2

This sounds dreadfully like a programming homework problem.
Maybe this will put you on the right path, instead of doing your work for you:

Note that the efficiency of an operation can be had by deriving it's Big-O value. You can, of course, derive this from the algorithm by evaluation (or solving its recurrence relation). However, if you're going to solve this by writing a program to do it, it's a little bit more complex. Either you set up a base "n" and calculate given cycles through, or you watch a thread being processed and determine the difference in time till completion.

Answer 3

lol!! i would like to answer your question but i dont want to do the exact code for you!
but its easier to code than to explain it in words, you probably wont understand it that way anyway!!!

use nested loops! ex..
for x < 10 x++
{ for y< 10 y++
{ if () }
c = a
a = b
b = c
}

Answer 4

main() {
time()
for(i=0;i<10000;i++)
quicksort();
}
time()
.
.
.
}
If you need further help you may contact me at [e-mail]