Insertion Sort

[jgialis]

Hello friends,

Im pretty stumped, not sure where I'm going wrong. Sometimes I get the correct output and other times if I switch the numbers around in an array it will output correct, but on subsequent run, it's incorrect.

void insertSort(int A[], int size)
{
 int j = 0;
 int temp = 0;

//SORT ARRAY
   for (int i = 0; i < size; ++i)
     {
	j = i + 1;
	while(j > 0 && A[j] < A[j-1])
	   {
		temp = A[j];
		A[j] = A[j-1];
		A[j-1] = temp;
		j--;
	    }
      }


//PRINT SORTED ARRAY
 for (int i = 0; i < size; ++i)
   {
	cout << A[i] << " ";
   }
	cout << "\n";

}

[Peter87]

When i is size-1, then j will be equal to size, which means A[j] is out of bounds.

[jgialis]

Thank you, I will go ahead and fix that.