c++代码:关于排序搜索测试示例

#include <iostream>
#include <vector>
#include <algorithm>

// 排序算法示例
void sortExample(std::vector<int>& nums) {
    std::sort(nums.begin(), nums.end());
}

// 二分查找示例
bool binarySearchExample(const std::vector<int>& nums, int target) {
    int left = 0;
    int right = nums.size() - 1;

    while (left <= right) {
        int mid = left + (right - left) / 2;

        if (nums[mid] == target) {
            return true;
        } else if (nums[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }

    return false;
}

int main() {
    std::vector<int> nums = {5, 2, 8, 3, 1, 9, 4};
    int target = 3;

    // 排序示例
    sortExample(nums);
    std::cout << "排序后的数组：";
    for (const auto& num : nums) {
        std::cout << num << " ";
    }
    std::cout << std::endl;

    // 二分查找示例
    bool isFound = binarySearchExample(nums, target);
    std::cout << "是否找到目标数：" << (isFound ? "是" : "否") << std::endl;

    return 0;
}