10.24.txt

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

void TwoWaySort(SqList &L)
{
    int i, j, len, first, final;
    RedType d[MAXSIZE+1];
    
    len = L.length;
    first = len-1;      //从后往前存
    final = 1;          //从前往后存
    d[0]= L.r[1];       //做中间比较标志
    
    for(i = 2; i <= len; i++){
        if(L.r[i].key > d[0].key){       
            for(j = final-1; L.r[i].key < d[j].key ; j--)
                d[j+1] = d[j];
            d[j+1] = L.r[i];
            final++; 
        }
        else {
            for(j = first+1; L.r[i].key > d[j%len].key; j++)
                d[j-1%len] = d[j%len];
            d[j-1%len] = L.r[i];
            first--;
        }
    }
    j = 1;
    for(i = first+1; i <= first + len; i++){
          L.r[j++] = d[i%len];
    }
    
}