我如何写一个程序来寻找数组中的最小差异(未排序) c++仅nlogn时间复杂度

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

int findMinDifference(std::vector<int>& nums) {
    std::sort(nums.begin(), nums.end()); // 对数组进行排序
    int minDiff = INT_MAX; // 最小差异值的初始值设置为最大整数
    for (int i = 1; i < nums.size(); i++) {
        int diff = nums[i] - nums[i - 1]; // 计算相邻元素的差异
        minDiff = std::min(minDiff, diff); // 更新最小差异值
    }
    return minDiff;
}

int main() {
    std::vector<int> nums = {3, 1, 4, 5, 2}; // 示例输入数组
    int minDiff = findMinDifference(nums);
    std::cout << "最小差异值为：" << minDiff << std::endl;
    return 0;
}