Step 1: Develop Algorithm

Here is our first attempt at a sorting algorithm.

void insertionsort( vector<int> & data )
{
  int i, n;
  
  n = data.size();

  for( unsigned int j=1; j < n; j++ )
  {
    for(i = j - 1; i >= 0 && data[i] > data[i+1]; i--)
    {
      swap (data, i, i+1);
    }
  }
}