Knapsack Greedy Algorithm

Greedy Knapsack 
{
   for i=1 to n                                     //step1 
   {
      compute pi/wi;                                //step2       
       
    }   
   sort objects in non- increasing order p/w;       //step3  
     for i=1 to n                                    //step4     
       if(m>0 && wi<=m)                             //step5
          m = m - wi;                               //step6
          P = P + pi;                               //step7
      else                                          //step8
        break;                                      //step9
  if(m>0)                                           //step10 
     P=P+ pi*(m/wi);                                //step11

}