Design analysis and Algorithm

5/24/2016 10:54:00 AM 0 Comments




In this chapter we discussion about :

Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; greedy algorithms; amortized analysis; graph algorithms; and shortest paths. Advanced topics may include network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, and parallel computing.

Secara umum, Analisis Algoritma bertujuan memeriksa efisiensi algoritma dari dua segi : waktu eksekusi dan penggunaan memori. Efisiensi waktu seberapa cepat algoritma dieksekusi. Efisiensi memori berapa banyak memori yang dibutuhkan untuk menjalankan algoritma


You can download the full chapter here : Design Analysis Algorithm Full Chapter

Unknown

Some say he’s half man half fish, others say he’s more of a seventy/thirty split. Either way he’s a fishy bastard.

0 komentar:

Langganan: Posting Komentar (Atom)