#include <iostream>
#include <ctime>
template <class T>
int getSizeOfArray(T& is){
return sizeof(is)/ sizeof(is[0]);
}
void insertionSort(int *is,int size){
for(int i=1;i<size;i++){
int currentIndex = i;
for(int j=currentIndex-1;j>=0;j--){
if(is[j]>is[currentIndex]){
int cup = 0;
cup = is[j];
is[j] = is[currentIndex];
is[currentIndex] = cup;
currentIndex = j;
}
}
}
}
int main() {
using namespace std;
clock_t startTime,endTime;
int is[] = {11,9,20,7,56,9,42,3,7,15,16};
int size = getSizeOfArray(is);
cout<< "原数列:";
for(int i = 0;i<size;i++)
{
cout<< is[i] << " ";
}
cout<< "\n" << "排序后:";
startTime = clock();
insertionSort(is,size);
endTime = clock();
for(int i = 0;i<size;i++)
{
cout<< is[i] << " ";
}
cout << "\n"<<"The run time is: " <<(double)(endTime - startTime) / CLOCKS_PER_SEC << "s" << endl;
return 0;
}