7.31作业

#include <iostream>
#include <string>
#include <vector>

template <typename T>
int partition(std::vector<T>& arr, int low, int high) {
    T pivot = arr[high];
    int i = low - 1;

    for (int j = low; j < high; ++j) {

        if (arr[j] <= pivot) {
            i++;
            std::swap(arr[i], arr[j]);
        }
    }
    std::swap(arr[i + 1], arr[high]);
    return i + 1;
}
                                                                      
template <typename T>
void quickSort(std::vector<T>& arr, int low, int high) {
    if (low < high) {

        int pi = partition(arr, low, high);


        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
    }
}

template <typename T>
void quickSort(std::vector<T>& arr) {
    quickSort(arr, 0, arr.size() - 1);
}


template <typename T>
void printArray(const std::vector<T>& arr) {
    for (const T& element : arr) {
        std::cout << element << " ";
    }
    std::cout << std::endl;
}
int main() {

    std::vector<int> intArr = {12, 4, 5, 6, 7, 3, 1, 15};
    std::cout << "Int 数组排序前: ";
    printArray(intArr);
    quickSort(intArr);
    std::cout << "Int 数组排序后: ";
    printArray(intArr);
    std::cout << std::endl;


    std::vector<double> doubleArr = {3.4, 1.2, 4.5, 2.3, 5.6};
    std::cout << "Double 数组排序前: ";
    printArray(doubleArr);
    quickSort(doubleArr);
    std::cout << "Double 数组排序后: ";
    printArray(doubleArr);
    std::cout << std::endl;


    std::vector<std::string> strArr = {"apple", "banana", "cherry", "date", "grape"};
    std::cout << "String 数组排序前: ";
    printArray(strArr);
    quickSort(strArr);
    std::cout << "String 数组排序后: ";
    printArray(strArr);
    std::cout << std::endl;
                                                                                               
    return 0;
}