#include <iostream>
#include <vector>
#include <algorithm> 
using namespace std;

// 辅助函数：复制数组
vector<int> copyArray(const vector<int>& original) {
    return vector<int>(original.begin(), original.end());
}


void InsertionSort(vector<int> &a) { // 这里加了 &
    int n = a.size();
    int key, j;
    for (int i = 1; i < n; i++) {
        key = a[i];
        j = i - 1;
        while (j >= 0 && a[j] > key) {
            a[j + 1] = a[j];
            j--;
        }
        a[j + 1] = key;
    }
}


void ShellSort(vector<int> &a, int gap) {
    int n = a.size();
    int j, key;
  
    for (int i = gap; i < n; i++) {
            key = a[i];
            j = i;
         while (j >= gap && a[j - gap] > key) {
                a[j] = a[j - gap];
                j -= gap;
            }
            a[j] = key;
        }
    
}


void SelectionSort(vector<...