Course Year : T0034 – Algorithm Design & Analysis : 2013 Session 26 Practices of Algorithm Analysis .

CASE 1 • Create an algorithm to calculate the number of divisor factor a number N! Bina Nusantara .

STAGE 5 • Code optimization • Find which section of the pseudocode that can be optimized! – – – – Check if all upper and lower bounds were optimal iteration Check if all the branching conditions are placed correctly Check if there is redundancy process Check if there are sections of pseudocode that could be removed without changing the results – Check if there is any other techniques that can be used Bina Nusantara .

STAGE 6 • Writing programs. testing • Perform repairs if necessary • Issues in choosing a programming language – – – – – Bina Nusantara Issues needed Speed Display Compatibility Memory and data types . compiling.

STAGE 7 • Implementation. training. maintenance • The last stage is often overlooked • A program mean nothing if users do not know how to use it! Bina Nusantara .

4. where X is 1 to N! • Example – – – – – – – Number of factor of 1 is a 1 Number of factor of 2 is a 2 Number of factor of 3 is a 2 Number of factor of 4 is a 3 Number of factor of 5 is a 2 Number of factor of 6 is a 4 And so on – It will be displayed: 1. 2. Bina Nusantara . 2. etc. 2. 3.CASE 2 • Make an algorithm to display the number of divider factor of X.

SOLVING OF CASE 2 • Do solution of case 2 with stages such as case 1! • Is the solution with the flagging technique can produce a better algorithm? Bina Nusantara .

the TSP is used as an example in several algorithm techniques. • Can the TSP be solved by Divide and Conquer? • Can the TSP be solved by the method Greedy? How did it go? • How is the TSP solution using Dynamic Programming? • How is the TSP solution using Branch and Bound? • Which one is the best technique to solve the TSP? • Why? Bina Nusantara .TRAVELING SALESMAN PROBLEM • In this course.

SELECTING ALGORITHM TECHNIQUE • What is the problem that Divide and Conquer is the best solution? • What is the problem that Greedy Method is the best solution? • What is the problem that Dynamic Programming is the best solution? • What is the problem that Backtracking is the best solution? • What is the problem that Branch and Bound technique is the best solution? • What is the problem that Full Search Tree is the best solution? Bina Nusantara .

Bina Nusantara .CLOSING • The key to success in mastering computer programming is practicing and keep practicing.

The MIT Press. New York. (1998) – Introduction to Algorithms • Thomas H Cormen. (2008) Bina Nusantara . • Jakarta. Sartaj Sahni. • Computer Science Press. Charles E Leiserson. • PT Prima Infosarana Media.Books References • References: – Computer Algorithms / C++ • Ellis Horowitz. Kelompok Gramedia. Sanguthevar Rajasekaran. Ronald L. (2009) – Algoritma Itu Mudah • Robert Setiadi. • 3nd Edition.

END Bina Nusantara .