Your SlideShare is downloading. ×
Lop1
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
284
On Slideshare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
12
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. Greedy and Divide and Conquer Approach Authors: 1.Devendra Agarwal 2.Irfan Hudda 3.karan Singh 4.Ankush Sachdeva
  • 2. Greedy Algorithms o Greedy algorithms are generally used in optimization problems o There is an optimal substructure to the problem o Greedy Algorithms are algorithms that  try to maximize the function by making greedy choice at all points. In other words, we do at each step what seems best without planning ahead  ignores future possibilities (no planning ahead)
  • 3. Contd.. • Usually O(n) or O(n lg n) Solutions. • But, We must be able to prove the correctness of a greedy algorithm if we are to be sure that it works
  • 4. Problem 1. • A family goes for picnic along a straight road. There are k hotels in their way situated at distances d1,d2…dk from the start. The last hotel is their destination. The can travel at most L length in day. However, they need to stay at a hotel at night. Find a strategy for the family so that they can reach hotel k in minimum number of days ?
  • 5. Solution • The first solution that comes to mind is to travel on a particular day as long as possible, i.e. do not stop at a hotel if and only if the next hotel can be reached on the same day.
  • 6. Proof Proof strategy for greedy algorithms: • Suppose there is a better solution which stops at hotels i1 < i2 ….ir and greedy solution stops at j1< j2….js and r<s • Consider the first place where the two solutions differ and let that index be p. Clearly ip < jp • On a given day when non greedy solution starts from hotel iq<jq, non greedy solution cannot end up ahead of greedy solution. • Therefore Greedy solution stays ahead
  • 7. Problem 2 • There are n processes that need to be executed. Process i takes a preprocessing time pi and time ti to execute afterwards. All preprocessing has to be done on a supercomputer and execution can be done on normal computers. We have only one supercomputer and n normal computers. Find a sequence in which to execute the processes such that the time taken to finish all the processes is minimum.
  • 8. Solution • Sort in descending order of ti and execute them. At least this is the solution for which no counter example is available.
  • 9. Proof • Let there be any other ordering sigma(1),sigma(2)….sigma(n) such that t_sigma(i) < t_sigma(i+1) for some i. • Prove that by executing sigma(i+1) before sigma(i), we will do no worse. • Keep applying this transformation until there are no inversions w.r.t. to t. This is our greedy solution.
  • 10. Problem 3 • A thief breaks into a shop only to find that the stitches of his bag have become loose. There are N items in the shop that he can choose with weight W[i] and value V[i]. The total weight that the bag can carry is W. Given that he can choose fraction amount of items find how should he choose the items to maximize the total value of the things he steals?
  • 11. Solution: • Sort the values according to vi/wi in decreasing order. Choose the weight which has maximum vi/wi ratio . If wi<Remaining_W choose that item fully else taken fractional part of it .
  • 12. Proof • Left as an exercise to the reader.
  • 13. Knapsack Problem
  • 14. Problem • Suppose we have n items U={u1, ..un}, that we would like to insert into a knapsack of size C. Each item ui has a size si and a value vi. • A choose a subset of items S  U such that v ui S i is max and s ui S i C
  • 15. Dynamic Programming Solution • For 1 j C & 1 i n, let V[i,j] be the optimal value obtained by filling a knapsack of size j with items taken from {u1, ..ui}. • Also V[i,0]=0 and V[0,j]=0. • Our Goal is to find V[n,C]
  • 16. Recursive Formula  0 if i  0 or j  0   V [i, j ]   V [i  1, j ] if j  si   max  [i  1, j ],V [i  1, j  si ]  vi   V otherwise
  • 17. Algorithm: KnapsackInput: Knapsack of size C, items U={u1, ..un}, with sizes s1, .., sn, and values v1, .., vnOutput: max  vi s.t. s i C ui S ui SFor i  0 to n V[i,0]  0 end forFor j  0 to C V[0,j]  0 end for for i  1 to n for j  1 to C V[i,j] = V[i-1,j] if si j then V[i,j] =max{V[i-1,j], V[i-1,j- si] + vi} end for end forend forReturn V[n,C]
  • 18. Performance Analysis • Time = (nC) • Space = (nC) • But can be modified to use only (C) space by storing two rows only.
  • 19. How does it work? 0 1 2 3 .......................s1...................s2.............................................C0 00000000000000000000000000000000001 0 0 0 0 0 0 0 0 0 0 0 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v12 0 Copy the above red line here. 0. 0. 0. 0 = max{ + v2, }. 0n 0
  • 20. How does it work? 0 1 2 3 .......................s1...................s2.............................................C0 00000000000000000000000000000000001 0 0 0 0 0 0 0 0 0 0 0 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v12 0 Copy the above red line here. 0. 0. 0. 0 = max{ + v2, }. 0n 0
  • 21. How does it work? 0 1 2 3 .......................s1...................s2.............................................C0 00000000000000000000000000000000001 0 0 0 0 0 0 0 0 0 0 0 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v12 0 Copy the above red line here. 0. 0. 0. 0 = max{ + v2, }. 0n 0
  • 22. How does it work? 0 1 2 3 .......................s1...................s2.............................................C0 00000000000000000000000000000000001 0 0 0 0 0 0 0 0 0 0 0 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v12 0 Copy the above red line here. 0. 0. 0. 0 = max{ + v2, }. 0n 0
  • 23. How does it work? 0 1 2 3 .......................s1...................s2.............................................C0 00000000000000000000000000000000001 0 0 0 0 0 0 0 0 0 0 0 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v1 v12 0 Copy the above red line here. 0. 0. 0. 0 = max{ + v2, }. 0n 0
  • 24. Divide and Conquer • Three Steps: 1. Divide Step: Divide the problem in two or more subproblem. 2. Recur Step: Find the Solution of the smaller subproblems 3. Merge Step: Merge the Solution to get the final Solution
  • 25. Problem 1 • Merge-sort is divide-n-conquer • Analysis of merge-sort T(n)=2*T(n/2) + O(n) T(n/2) : Time taken to sort the left / right part. O(n) : c*n time taken to merge them . Problem- Find number of inversions by modifying code for merge-sort slightly ?

×