Muhammad Bayu Dwi Ardiansyah

1187010054

Fungsi Rekursif

Input size = n Basic operation is multiplication

Formula :

𝐹(𝑛) = 𝐹(𝑛 – 1) ∗ 𝑛 ; 𝑛 > 0 Rekursif

𝐹(0) = 1 Rekursif

The number of multiplication

𝑀(𝑛) = 𝑀(𝑛 – 1) + 1 ∶ 𝑛 > 0

If n = 0 return 1

- Panggilan akan berakhir ketika n=0

- 𝑀(0) = 0 → 𝑖𝑛𝑖𝑡𝑖𝑎𝑙 𝑐𝑜𝑛𝑑𝑖𝑡𝑖𝑜𝑛

Membuat fungsi kompleksitas

Cara 1 : substitusi ( melihat polanya)

Contoh :

𝑀(𝑛) = 𝑀(𝑛 – 1) + 1

𝑀(𝑛) = [𝑀(𝑛 – 2) + 1] + 1

𝑀(𝑛) = 𝑀(𝑛 – 2) + 2

𝑀(𝑛) = [𝑀(𝑛 – 3) + 1] + 2

𝑀(𝑛) = 𝑀(𝑛 – 3) + 3

=⋯

Sehingga memiliki pola baru

𝑀(𝑛) = 𝑀(𝑛 – 𝑖) + 𝑖

Initial condition , 𝑛 = 0 → 𝑖 = 𝑛