insertionSort

insertionSort

 

main.cpp 

#include <iostream>
#include <iomanip>
#define MAX_ARY_SIZE 15
using namespace std;
void insertionSort(int list[], int last);

int main()
{
 int ary[MAX_ARY_SIZE] = {12,123,34,12,3,65,78,45,67,45,78,65,5,454,576};

 cout<<"before sort"<< endl;

 for(int i=0; i<MAX_ARY_SIZE; i++)
 {
  cout<< setw(5)<< *(ary+i);
 }
 cout<<endl;

 insertionSort(ary,MAX_ARY_SIZE-1);
 
 cout<<"after sort"<< endl;

 for(int i=0; i<MAX_ARY_SIZE; i++)
 {
  cout<< setw(5)<< *(ary+i);
 }
 cout<<endl;
}

void insertionSort(int list[], int last)
{
 int current =1;
 int hold;
 int walker;

 for(current = 1; current <=last; current++)
 {
  hold = list[current];
  walker = current -1;
  
  for(walker=current-1; walker >=0 && hold<list[walker]; walker--)
  {
   list[walker +1] = list[walker];

   cout << "passs"<<walker<<endl;

   for(int i=0; i<MAX_ARY_SIZE; i++)
   {
   cout<< setw(5)<< *(list+i);
   }
   cout<<endl;
  }

  list[walker +1]= hold;
 }
 
}
/*
void insertionSort(int list[], int last)
{
 int current =1;
 int hold;
 int walker;

 while(current<=last) // for(current = 1; current <=last; current++)
 {
  hold = list[current];
  walker = current -1;
  
  while(walker>=0 && hold < list[walker])//for(walker=current-1; walker >=0 && hold<list[walker]; walker++)
  {
   list[walker +1] = list[walker];
   walker = walker -1;
  }
  list[walker +1]= hold;
  current = current +1;
 }
 return;
}
*/