计算一个数列中两个元素之间最小的差值

参考网上看到的思路
先将一组数从小到大排列，那么最小的差值一定出现在相邻的两个元素之间。

def cal_min_diff(vec):  # 计算一个向量(ndarray类型，形状为(ndimension,))两个元素之间的最小的差值 
    size = vec.shape[0]
    vec = np.sort(vec)
    diff = vec[-1] - vec[0]
    for i in range(size - 1):
        diff_temp = vec[i + 1] - vec[i]
        if diff_temp < diff:
            diff = diff_temp
    return diff