直接插入排序（C++模版技術實現）

下面代碼僅供本人複習資料結構所用，實用性N低，各位飄過吧~~哈哈:>

//// C++ 模版技術實現直接插入排序. // #include <cstdlib>#include <cstring> #include <iostream>template <typename T>void insertionSort(T *array, const size_t count){T temp;for (size_t i = 1, j; i < count; ++i){for (j = i, temp = array[j]; 0 < j && temp < array[j - 1]; --j){array[j] = array[j - 1];}array[j] = temp;}} //// 測試 //int main(void){char szTest[] = "Insertion sort algorithm test case !"; int iarrTest[] = {23, 12, 2, 123, 72, 35, 49, 51, 83, 94, 65}; const size_t INT_ARR_SIZE = sizeof(iarrTest) / sizeof(iarrTest[0]);insertionSort(szTest, strlen(szTest));insertionSort(iarrTest, INT_ARR_SIZE);std::cout << szTest << std::endl;for (size_t i = 0; i < INT_ARR_SIZE; ++i){std::cout << iarrTest[i] << " "; }std::cout << std::endl;return EXIT_SUCCESS; }