So I have this program to do where i pull numbers from a very large data file then run it through an insertion sort 1000 times, then i do it 3 more times with more and more numbers.
my problem is, I cant seem to get the data to run through the insertion sort. I also need to time how long it takes and to solve for n. I understand the insertion sort but i really dont know how to time it. i am a beginner and i know my code isnt all right, but i do know the insertion sort is right (got it from the book). Any tips and pointers...no pun intended...would be helpful