改進冒泡排序——雞尾酒排序（C++模版技術實現）

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

//// C++模版技術實現雞尾酒排序（改進的冒泡排序）. // #include <cstdlib>#include <cstring>#include <iostream>template <typename T>void swap(T &x, T &y){T temp = x;x = y;y = temp;}template <typename T>void cocktailSort(T *array, const size_t count){bool isSwap = true;size_t top = 0, bottom = count - 1, i;T temp;do {isSwap = false;// // 從上到下比較. //for (i = top; i < bottom; ++i){if (array[i] > array[i + 1]){swap(array[i], array[i + 1]);isSwap = true;}}//// 從下到上比較. //for (i = --bottom; i > top; --i){if (array[i] < array[i - 1]){swap(array[i], array[i - 1]);isSwap = true;}}++top;} while (true == isSwap);} //// 測試 //int main(void){char szTest[] = "Cocktail 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]);cocktailSort(szTest, strlen(szTest));cocktailSort(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; }