清風(fēng)竹林

C/C++ code

void swap(BYTE *a,BYTE *b)
{
    BYTE tmp;
    if ( a != b )
    {
        tmp = *a;
        *a = *b;
        *b = tmp;
    }
}

void quicksort(BYTE *arr, int left, int right)
{
    if (left < right)
    {
        BYTE v = arr[right];
        int i = left - 1,j = right,p = left - 1,q = right,k=0;
        while (1)
        {
            while (arr[++i] < v);
            while (arr[--j] > v)
                if(j==left)
                    break;
            if (i >= j)
                break;
            swap(&arr[i], &arr[j]);
            if(arr[i] == v)
            {
                p++;
                swap(&arr[p],&arr[i]);
            }
            if(arr[j] == v)
            {
                q--;
                swap(&arr[q],&arr[j]);
            }
        }
        swap(&arr[i],&arr[right]);
        j = i - 1;
        i++;
        for(k=left; k<=p; k++,j--)
            swap(&arr[k],&arr[j]);
        for(k=right-1; k>=q; k--,i++)
            swap(&arr[k],&arr[i]);
        quicksort(arr,left,j);
        quicksort(arr,i,right);
    }
}

void QuickSort(BYTE *array,int length)
{
    quicksort(array,0,length-1);
}

C/C++ code

void CombSort(BYTE *arr, int size)
{
    UINT gap = size, swapped = 1, i = 0;
    BYTE swap = 0;
    while ((gap > 1) || swapped)
    {
        if (gap > 1)
            gap = gap / 1.3;
        swapped = 0; 
        i = 0;
        while ((gap + i) < size)
        {
            if (arr[i] - arr[i + gap] > 0)
            {
                swap = arr[i];
                arr[i] = arr[i + gap];
                arr[i + gap] = swap;
                swapped = 1;
            }
            ++i;
        }
    }
}

C/C++ code

#define R 256

#define digit(a, d)    ( a >> 8*d )

static BYTE *aux;

void radix_sort(BYTE *arr, int left, int right)
{
    if(left < right)
    {
        int d = 0;
        for(d=3; d>=0; d--)
        {
            int i=0, j=0, count[R+1];
            for(j=0; j<R; j++)
                count[j] = 0;
            for(i=left; i<=right; i++)
                count[digit(arr[i],d) + 1]++;
            for(j=1; j<R; j++)
                count[j] += count[j-1];
            for(i=left; i<=right; i++)
                aux[count[digit(arr[i],d)]++] = arr[i];
            for(i=left; i<=right; i++)
                arr[i] = aux[i-1];
        }    
    }
}

void RadixSort(BYTE *array,int length)
{
    aux = (BYTE*)malloc(length);
    radix_sort(array,0,length-1);
    free(aux);
}

C/C++ code

void merge(BYTE *array, int low, int mid, int high)
{
    int i, k;
    BYTE *temp = (BYTE *) malloc(high-low+1);
    int begin1 = low;
    int end1 = mid;
    int begin2 = mid + 1;
    int end2 = high;

    for (k = 0; begin1 <= end1 && begin2 <= end2; ++k)
        if(array[begin1]<array[begin2])
            temp[k] = array[begin1++];
        else
            temp[k] = array[begin2++];    
    while(begin1<=end1)
        temp[k++] = array[begin1++];
    while(begin2<=end2)
        temp[k++] = array[begin2++];
    for (i = 0; i < (high-low+1); i++)
        array[low+i] = temp[i];
    free(temp);
}

void merge_sort(BYTE *array, UINT first, UINT last)
{
    UINT mid,i;
    for(mid=1; mid<=last-first; mid += mid)
        for(i=first; i<=last-mid; i+=mid+mid)
            merge(array,i,i+mid-1,min(i+mid+mid-1,last));
}

void MergeSort(BYTE *array, UINT length)
{
    merge_sort(array,0,length-1);
}

posted on 2010-11-25 09:59 李現(xiàn)民 閱讀(907) 評(píng)論(2)  編輯 收藏 引用 所屬分類(lèi): 絕對(duì)盜版 、算法為魂