Facebook聊天翻译功能全面解析：设置步骤与实现方式

#include <vector>
#include <algorithm>

void quickSort(std::vector<int>& arr, int low, int high) {
    if (low < high) {
        int pivot = partition(arr, low, high);
        quickSort(arr, low, pivot - 1);
        quickSort(arr, pivot + 1, high);
    }
}

int partition(std::vector<int>& arr, int low, int high) {
    int 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;
}

#include <gtest/gtest.h>
#include "quickSort.h"

TEST(QuickSortTest, SortsEmptyVector) {
    std::vector<int> arr = {};
    quickSort(arr, 0, arr.size() - 1);
    EXPECT_TRUE(arr.empty());
}

TEST(QuickSortTest, SortsSortedVector) {
    std::vector<int> arr = {1, 2, 3};
    quickSort(arr, 0, arr.size() - 1);
    ASSERT_EQ(arr, (std::vector<int>{1, 2, 3}));
}