A.

TUGAS PENDAHULUAN
1. Menampilkan bilangan fibonacci pertama sampai ke-n

START

Int *fibo;
Input n
Int n;

fibo = (int*)malloc(n*sizeof(int));
*(fibo + i) = (*(fibo + i-2) + *(fibo + I -1)); *(fibo + 1) =1;
i++; *(fibo + 2) =1;
Int i = 3;

YES NO
I<=n? i=1;

print %d”,”
I++;
(fibo + i)

NO YES
free(fibo); I<=n?

END
2. Menampilkan bilangan prima pertama sampai ke – n

Int *prima;
Int n, m;
START Int cek = 1;
std::vector<int> temp;

prima = (int*)malloc(sizeof(int));
realloc(prima, m* sizeof(int)); Input n
temp.push_back(1);

NO

I <=1000? J<i?

YES J++;
NO
Temp.size() NO
(I % j) == 0 ?
== n ?

YES

I = 0; cek = 0;

NO NO
I < temp. cek == 1?
(); ?

YES YES

*(prima + I + 1) = temp [i]; temp.push_back(i);

I++;

i = 1; cek = 1;

NO
END I <= *(prime+i)

i = 1; Print*(prime + 1)