implementing time.h to quicksort and selectionsort algorithm

How do you implement time.h in quicksort and selectionsort?

This is because I need to do a comparative study of their running times but I do not know how to do it.

Your help will be truly appreciated!

Thanks.

Thanks.

But I believe it only gets time in seconds and the program finishes in less than a second.

Thus 0 second is recorded.

How do I get it to compute how fast it executes in milliseconds?

Thanks again!

Quote:

---

Originally posted by ghe02
Thanks.

But I believe it only gets time in seconds and the program finishes in less than a second.

Thus 0 second is recorded.

How do I get it to compute how fast it executes in milliseconds?

Thanks again!

---

You did read all of Salem's post, right?