初学数据结构二

Status DeleteK(SqList&a, int i, int k)
{
    if (i < 1 || k<0 || i + k>a.length)
        return INFEASIBLE;
    else
        for (count = 1; count < k; count++)
        {
            for (j = a.length; j >= i + 1; j--)
                a.elem[j - i] = a.elem[j];
            a.length--;
        }
        return OK;
}

Status DeleteK(SqList&a, int i, int k)
{
    int j;
    if (i<0 || i>a.length - 1 || k<0 || k>a.length - i)
        return INFEASIBLE;
    for (j = 0; j <= k; j++)
        a.elem[j + i] = a.elem[j + i + k];
    a.length = a.length - k;
    return OK;
}

int Time(int n)
{
    count = 0;
    x = 2;
    while (x < n / 2)
    {
        x *= 2;
        count++;
    }
    return count;
}

int Fibonacci(int k, int n)
{
    if (k < 1)
        exit(OVERFLOW);
    int *p, x;
    p = new int[k + 1];
    if (!p)
        exit(OVERFLOW);
    int i, j;
    for (i = 0; i < k + 1; i++)
    {
        if (i < k - 1)
            p[i] = 0;
        else
            p[i] = 1;
    }
for (i = k + 1; i < n + 1; i++)
{
    x = p[0];
    for (j = 0; j < k; j++)
        p[j] = p[j + 1];//数组向前移动
    p[k] = 2 * p[k - 1] - x;//对数据最后一个元素赋值，否则为空，必须销毁
}
}

#include<iostream>
#include<cstdlib>
#define N 10
using namespace std;
double polynomail(int a [], int i, double x, int n);
int main()
{
    double x;
    int n, i;
    int a[N];
    cout << "input x:";
    cin >> x;
    cout << "input n:";
    cin >> n;
    if (n > N - 1)
        exit(0);
    cout << "a[0]-a[n]:";
    for (i = 0; i <= n; i++)
        cin >> a[i];
    cout << "The polynomail value is:" << polynomail(a, n, x, n) << endl;
    system("pause");
    return 0;
}
double polynomail(int a [], int i, double x, int n)
{
    if (i > 0)
        return a[n - i] + polynomail(a, i - 1, x, n)*x;
    else
        return a[n];
}