Algorithm Design approaches Dr. Jey Veerasamy. Petrol cost minimization problem You need to go from S to T by car, spending the minimum for petrol. 2.

Presentation on theme: "Algorithm Design approaches Dr. Jey Veerasamy. Petrol cost minimization problem You need to go from S to T by car, spending the minimum for petrol. 2."— Presentation transcript:

Algorithm Design approaches Dr. Jey Veerasamy

Petrol cost minimization problem You need to go from S to T by car, spending the minimum for petrol. 2 ST

Quick-sort

Merge-sort

Divide & Conquer - characteristics

# of stops minimization problem Similar to petrol cost minimization problem, but we are minimizing # of stops. ST

Activity selection problem

Fractional knapsack problem Gold powder, silver powder, … Thief has limited weight capacity

Greedy approach - characteristics

10 Fibonacci number problem Definition of Fibonacci number: F(1) = 1 F(2) = 2 F(n) = F(n-1) + F(n-2), when n > 2 Recursive solution using D&C approach: int f(int n) { if (n == 1) return 1; else if (n == 2) return 2; else return f(n-1) + f(n-2); }

11 D&C Solution for F(6) F(1)F(2) F(3)F(2) F(4) F(3) F(5) F(2)F(1) F(6) F(1)F(2) F(3)F(2) F(4) Several subproblems are solved repeatedly - Not an efficient approach.

12 DP solution for F(6) F(1)F(2)F(3)F(4)F(5)F(6) DP uses a table and bottom-up approach (note that D&C used top-down approach): int fib(int n) { int f[n+1]; f[1] = 1; f[2] = 2; for (i=3 ; i<= n ; i++) f[i] = f[i-1]+f[i-2]; return f[n]; } Computations are NOT repeated!

Knapsack problem Individual pieces with specific weights, thief wants to know whether there is an exact match for his weight limit.

Dynamic programming - characteristics

Download ppt "Algorithm Design approaches Dr. Jey Veerasamy. Petrol cost minimization problem You need to go from S to T by car, spending the minimum for petrol. 2."

Similar presentations