insort2.cpp

来自「一本全面剖析C++数据结构算法的书籍」· C++ 代码 · 共 13 行

// insertion sort

#include <iostream.h>
#include "insort.h"

void main(void)
{
   int y[10] = {10,7,8,9,4, 2, 3, 6, 5,1};
   InsertionSort(y,10);
   for (int i = 0; i < 10; i++)
      cout << y[i] << ' ';
}