insertion sort complexity ananlysis

10madhurima's Avatar, Join Date: Jan 2008
Newbie Member
hi
i need the solution of this problem. if any1 can plz help me out.
Using C implement the following
sorting algorithms:
• Insertion sort
Run this algorithm on the arrays of the following sizes: 10000,20000,30000,40000,50000. Use random number generators to generate the input arrays. For each input size,
run your programs at least 5 times (with different inputs) and report the average
performance across these runs.
0
technosavvy's Avatar
Contributor
use internet ...read books..there is no help needed in this case..
if you have any issues while implementation then we all here are ready to help you out..
0
10madhurima's Avatar, Join Date: Jan 2008
Newbie Member
thanks for ur concern.
actually i m nt able to find out the proper procedure to do so.
i huv witten the code that pefoms sorting on random numers but not able to calculate the time
so that i can put in the eqn
0
Salem's Avatar, Join Date: Nov 2007
Ambitious contributor
Well the standard clock() function (see stdlib.h) can tell you to about 1 second accuracy how much CPU time has elapsed between two points in the code.

But if you want higher precision timers, you need to tell us which OS/Compiler you're using.