Re: [algogeeks]

2013-06-22 Thread rajesh singarapu
hmmm think of this... no of 1s in bin no of size 1 is 1 2 is 2 pow 1 + no of 1s in size 1 3 is 2 pow 2 + 2 * no of 1s in size 2 4 is 2 pow 3 + 2 * no of 1s in size of 3 think in this lines... On Jun 21, 2013 8:33 AM, shubham saini shubhamsain...@gmail.com wrote: How to count no of set bits

Re: [algogeeks] Need Valuable suggestions

2012-06-11 Thread rajesh singarapu
depends on how experienced you are, if you are somewhere 5yrs exp, you can go to small company and excel, but if you are too less experienced, then it is wise to go for brand, it is good for future jumps/opportunities. Congrats thanks Rajesh On Mon, Jun 11, 2012 at 11:39 AM, SANDEEP CHUGH

Re: [algogeeks] Need Valuable suggestions

2012-06-11 Thread rajesh singarapu
oops it is5yrs On Mon, Jun 11, 2012 at 11:43 AM, rajesh singarapu rajesh0...@gmail.com wrote: depends on how experienced you are, if you are somewhere 5yrs exp, you can go to small company and excel, but if you are too less experienced, then it is wise to go for brand, it is good

Re: [algogeeks] Book Feedback needed for book from Narasimha Karumanchi

2012-06-08 Thread rajesh singarapu
Its a book worth have. On Fri, Jun 8, 2012 at 1:44 PM, Ashish Goel ashg...@gmail.com wrote: Hi, I came across Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles Request for feedback if it is worth purchase. Best Regards Ashish Goel Think positive and

Re: [algogeeks] If any one have algorithms for interviews by adnan aziz ebook... Please mail ...

2012-06-07 Thread rajesh singarapu
please share the link. thanks Rajesh On Thu, Jun 7, 2012 at 1:44 AM, Prakhar Jain jprakha...@gmail.com wrote: @abhishek...Plz share the link here.Thanks -- Prakhar Jain IIIT Allahabad B.Tech IT 3rd Year Mob no: +91 9454992196 E-mail: rit2009...@iiita.ac.in          

Re: [algogeeks] problem of fork()

2012-05-23 Thread rajesh singarapu
main process have completed till the time all processes processes prints Hello World, to prevent it, use wait/wait4 family of fucntions. ~r On Thu, May 24, 2012 at 8:26 AM, Rajesh Kumar testalgori...@gmail.com wrote: #includestdio.h main() { fork(); fork(); fork(); printf(Hello Word\n);

Re: [algogeeks] Re: C Trick

2011-08-26 Thread rajesh singarapu
abs function itself has a condition?? I think it is not that good solution. On Wed, Aug 24, 2011 at 6:33 PM, priyanka raju priyark...@gmail.com wrote: int a,b,max,min; max=(a+b+abs(a-b))/2; min=(a+b-abs(a-b))/2; -- cheers priyanka -- You received this message because you are

Re: [algogeeks] an array question

2011-08-12 Thread rajesh singarapu
use something like radix sort, but from numbers left to right. in given example: 87 36 52 87 36 52 place 87 then 52 than 36 if input is something like 9 87 36 52 place 9875236 this you can do with minor modification of radix sort. thanks Rajesh On Fri, Aug 12, 2011 at 6:31 PM,