[数据结构] 快速排序+折半搜索

数据结构的练习与巩固
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//折半搜索
int Quick_Search(int List[], int Length, int Number)
{
    int Low, High, Middle;
    Low = 0;
    High = Length-1;
    
    while (High >= Low)
    {
        Middle = (Low + High) / 2;
        if (List[Middle] == Number)
            return Middle;
        if (List[Middle] < Number)
            Low = Middle + 1;
        if (List[Middle] > Number)
            High = Middle - 1;
    }
    return -1;
}

//快速排序
void Quick_Sort(int List[], int Low, int High)
{
    int i, j;
    i = Low;
    j = High;
    int Key = List[Low];

    if(Low < High)
    {
        while (j > i)
        {
            while (List[j] >= Key && j > i)
                j--;
            if (j > i)
                List[i++] = List[j];

            while (List[i] < Key && j > i)
                i++;
            if (j > i)
                List[j--] = List[i];
        }
        List[i] = Key;

        Quick_Sort(List, Low, i - 1);
        Quick_Sort(List, i + 1, High);
    } 
}