Sorting array algoritms

See more:

C++

selection

algorithm

Hi
I'm working on a sorting algoritm but something isn't right when I test it:

http://i60.tinypic.com/98zg5e.jpg[^]

Hope you can see the picture.

It should stop at 2 min mark but it doesn't. I don't know if I got the time wrong or something.
This is a insert-algoritm. I'm also going to work with bubble and selection, but I'm focused on the insert right now.

So can it really be right that it has sorted 10 000 000 elements after 2.6 sec? Or can you spot any other errors in the code?

My code:

void simpleSort( double* arr, int length )
{
	int j;
	double numbers; 

	for( int i=0; i<length; i++)
	{
		j = i;
		while(j > 0 && arr[j - 1] > arr[j])
		{
			numbers = arr[j];
			arr[j] = arr[j-1];
			arr[j-1] = numbers;
			j--;
		}
	}



  
}




void main()
{
	int arrayLength = 1000;
	bool twoMinutesPassed = false;

while (twoMinutesPassed == false)
{
	double* arrTimeCheck = new double[arrayLength];

	for(int i=0; i < arrayLength; i++)
	{
		
		double randNumber = rand()/RAND_MAX;
		arrTimeCheck[i] = randNumber;
	}

	//Retrieves the number of milliseconds that have elapsed since the system was started, up to 49.7 days.
	double startTime = GetTickCount();
	
	simpleSort(arrTimeCheck, arrayLength);

	double endTime = GetTickCount();

	double totalTime = endTime - startTime;

	double totalTimeSec = totalTime / 1000;

	cout << totalTimeSec << " sek ....." << arrayLength << endl;

	
	if(totalTime <120000)
		arrayLength *= 1.2;
	delete[] arrTimeCheck;
}