{C++} Growing Tree

/* g++ grow.cpp -o grow && strip grow */

#include <cstdio>
using namespace std;

void grow(int n)
{
    int * array = new int[n+1];

    array[0] = 1;
    int i;

    for (i=1; i<=n; i++)
    {
        if (i%2) {
            array[i] = array[i-1] * 2;
        } else {
            array[i] = array[i-1] + 1;
        }
    }

    printf("Tinggi mula-mula = 1 m\n");
    for (i=1; i<=n; i++) {
        printf("Tinggi pada siklus pertumbuhan ke-%d = %d\n", i, array[i]);
    }

    delete [] array;
}

int main()
{
    int n;
    printf("Jumlah pertumbuhan = "); scanf("%d", &n);
    grow(n);

    return 0;
}