Perbandingan Pendekatan Rekursif dan Pemrograman Dinamis Dalam Penyelesaian Persoalan World Series Odds  

Oleh:

Widiarti, Anastasia Rita

Jenis: Article from Journal - ilmiah nasional - tidak terakreditasi DIKTI
Dalam koleksi: SIGMA: Jurnal Sains dan teknologi vol. 6 no. 2 (Jul. 2003), page 183-192.
Topik: Recursive approach; dynamic programming; running time; world series odds

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: SS25.4 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

There are several algorithms that can be used to solve a problem. The world series odds problem can be solved using algorithm with recursive or dynamic programming approach. The results of computing the running time of the algorithms and analyzing the programs show that, to solve the problem of world series odds, the dynamic programming approach is more efficient than the recursive approach.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali