2020-03-06查找数组中两个相差最小的两个数的差（快速排序）

#include 
#include 

using namespace std;
void quickSort(int *a,int start,int End);
int result(int arr[],int len);
int main()
{
    int a[] = {45,8,2,4,9,32,56,41,56,32,54,27,55,62};
    cout<<"排序之前元素：\n";
    for(int i = 0;i < 14; i ++ ){
        cout<key){
            if(i == high)
                break;
        }
        while(arr[--j]=j)break;
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    cout<<"交换"<