[algogeeks] AN INVITATION TO EARN MONEY ON LINE!!!

Opportunities are knocking at your doors. Earn money upto $250 dollars per day!! No investment. Genuine on line jobs for home makers, retired persons and students ! Just click the ads or Join any affiliate progammes It is really amazing!!!Create your Account refer your friends to earn launch refer

[algogeeks] you need money without invesment earn weekly$5000to$10000

you need money without invesment earn weekly$5000to$1 otherinformations logonto * http://www.AWSurveys.com/HomeMain.cfm?RefID=sureshrania http://www.AWSurveys.com/HomeMain.cfm?RefID=sureshrania http://www.AWSurveys.com/H

[algogeeks] Discussion on unique-elements-in-an-array

yup possible but tradeoff in space complexity increases. first use count sort principle int a[10]; is the array with duplicate elements; let b[n] contain no of times each element occurs. let c[i]=b[a[i]] for all values of i; decrease b[i] once every time --~--~-~--~~~--