10.43.txt

数据结构实验 如下： Status Fibonacci(int k, int m, int &f) /* 求k阶斐波那契序列的第m项的值f */

void CountSort(SqList &L)
/* 采用顺序表存储结构，L.r存储序列a，L.length为n */
/* 在函数内自行定义计数数组c                     */
{
    int c[1001], i, j;
    int count, min, k, tem;
    RedType temp;
    for(i = 1; i <= L.length; i++){
        count = 0;
        for(j = 1; j <= L.length; j++){
            if(L.r[j].key < L.r[i].key) count++;
        }
        c[i] = count;
    }
    for(i = 1; i <= L.length; i++ ){
        min = 1000;
        for(j = i; j <= L.length; j++){
            if(c[j] < min) {
                k = j;
                min = c[j];
            }
        }
        temp = L.r[k];
        L.r[k] = L.r[i];
        L.r[i] = temp;
        tem = c[k];
        c[k] = c[i];
        c[i] = tem;
    }
}