[algogeeks] Re: Citrix interview question

2009-09-15 Thread Tanmoy Sarkar
It will print 49 and the value of i after execution of printf statement becomes 9 so since its a postfix increment first i*i is done and then i will be incremented twice On Tue, Sep 15, 2009 at 6:27 PM, ntini wrote: > > Hi Friends, > > Today I had interview @ Citrix. I was asked a question. >

[algogeeks] Re: time complexity of algorithms

2006-12-17 Thread Tanmoy Sarkar
hello look the best case of circular queue is 0(1) and worst case is 0(n) so avg. case should be between these two so if n+1/2 is avg case then also avg. case will be then 0(n). plz check it and may be i am wrong bye On 12/16/06, programming <[EMAIL PROTECTED]> wrote: > > > > programming