10.32.txt

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

void HFlag(FlagList &f)
{
    int i, j, k;
    ColorType temp;
    i = j = 1;
    k = f.length;
    while(j <= k){
        switch(f.r[j]){
            case '0':
                temp = f.r[i];
                f.r[i] = f.r[j];
                f.r[j] = temp;
                i++;
                j++;
                break;
            case '1':
                j++;
                break;
            case '2':
                temp = f.r[k];
                f.r[k] = f.r[j];
                f.r[j] = temp;
                k--;
                break;
        }
    }
}




void HFlag(FlagList &f)
{
    int low, high, k;
    float key;
    low = 1;
    high = f.length;
    f.r[0] = f.r[low];
    key = '0' + 0.5;
    while(low < high){
        while(low < high && (float)f.r[high] >= key)
            high--;
        f.r[low] = f.r[high];
        while(low < high && (float)f.r[low] <= key)
            low++;
        f.r[high] = f.r[low];
    }
    f.r[low] = f.r[0];        
    
    
    if(f.r[low] == '0') low++;
    high = f.length;
    
    f.r[0] = f.r[low];
    key = '0' + 1.5;
    while(low < high){
        while(low < high && (float)f.r[high] >= key)
            high--;
        f.r[low] = f.r[high];
        while(low < high && (float)f.r[low] <= key)
            low++;
        f.r[high] = f.r[low];
    }
    f.r[low] = f.r[0];        
}