AI-Ziping Chen

2.shell排序#include <iostream>#include <vector>using namespace std;template <typename T>void shellSort(vector<T> &a){ for (int gap = a.size() / 2; gap > 0; gap /= 2) { for (int i = gap; i

3.堆排序#include <iostream>#include <vector>using namespace std;inline int leftChild(int i){ return 2 * i + 1;}template <typename T>void percDown(vector<T> &a, int i, int n){ int child; T

1.插入排序普通版本#include <iostream>#include <vector>#include <ctime>using namespace std;template <typename T>void insertionSort(vector<T> &a){ int i; for (int j = 1; j < a.size(); j++) {