8。25 第二训练代码

#include <stdio.h>

void g1(int *a, int n, int i)

{

    while (2 * i <= n)

    {

        int j = 2 * i;

        int v = a[j - 1];

        if (j < n && v < a[j])

        {

            v = a[j];

            j += 1;

        }

        if (a[i - 1] < v)

        {

            int tmp = a[i - 1];

            a[i - 1] = v;

            a[j - 1] = tmp;

            i = j;

        } else

        {

            break;

        }

    }

}

int g2(int *a, int n, int m)

{

    int i;

    for (i = n / 2; i > 0; --i)

        g1(a, n, i);

    for (i = 0; i < n && a[i] != m; ++i);

    int j = 0;

    for (++i; i > 0; i /= 2)

        ++j;

    return j;

}

int main(int argc, char* argv[])

{

    int a[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16};

    int n = sizeof(a) / sizeof(a[0]);

    printf("%d", g2(a, n, 8));

    return 0;

}