time complexity and knapsack problem

[pankajkumar]

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

[EdEarl]

you already posted this and have two responses

[swansont]

!

Moderator Note

One thread per discussion topic, please.