pankajkumar Posted May 30, 2013 Share Posted May 30, 2013 Ques.1 If P1/W1 is less than P2/W2...less than Pn/Wn, prove greedy generate optimal solution to knapsack prob.? Ques.2 time complexity of- for i:= 1 to n do for j:= i+1 to n do for k:= j+1 to n do z= z+1 Link to comment Share on other sites More sharing options...
EdEarl Posted May 30, 2013 Share Posted May 30, 2013 you already posted this and have two responses Link to comment Share on other sites More sharing options...
swansont Posted May 30, 2013 Share Posted May 30, 2013 ! Moderator Note One thread per discussion topic, please. Link to comment Share on other sites More sharing options...
Recommended Posts