//
// main.cpp
// Data Structure TRY1
//
// Created by zr9558 on 6/7/13.
// Copyright (c) 2013 zr9558. All rights reserved.
//
// Data Structure C++, Weiss, P.263 Insertion Sort
#include<iostream>
using namespace std;
#include<vector>
#include<math.h>
template<typename Comparable>
void insertionSort( vector<Comparable> &a)
{
int j;
for( int p=1; p<a.size(); ++p)
{
Comparable temp=a[p];
for( j=p; j>0 && temp<a[j-1]; j--)
a[j]=a[j-1];
a[j]=temp;
}
}
int main()
{
vector<int> ivec;
for( int i=0; i<30; ++i)
ivec.push_back(rand()%100);
for( int i=0; i!=ivec.size(); ++i)
cout<<ivec[i]<<" ";
cout<<endl;
insertionSort(ivec);
for( int i=0; i!=ivec.size(); ++i)
cout<<ivec[i]<<" ";
cout<<endl;
return 0;
}