@harshal: the link which u posted requires an invitation.. pls see to it
On Mon, Aug 8, 2011 at 12:51 AM, KK kunalkapadi...@gmail.com wrote:
@Harshal: Thanx
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
@ankit: pls explain the time complexity..
i dont think its O(log n)
On Thu, Jun 9, 2011 at 11:57 PM, ankit sambyal ankitsamb...@gmail.comwrote:
@Dumanshu: In each iteration, we r removing the smallest number. If
at any iteration we can't find the next smallest no., it means that
no. is
pahwa varunpahwa2...@gmail.com
wrote:
@ankit :please explain by taking an example.
On Fri, Jun 10, 2011 at 12:13 PM, Vetri Balaji vetribal...@gmail.com
wrote:
@ankit: pls explain the time complexity..
i dont think its O(log n)
On Thu, Jun 9, 2011 at 11:57 PM, ankit sambyal
int flip(int j,int k,int n)
{
int t1=(1j)-1;
int t2=(1k)-1;
t1=t2^t1;
return n^t1;
}
correct me if im wrong
On Fri, Jun 10, 2011 at 10:09 PM, Kunal Patil kp101...@gmail.com wrote:
How about this???
*
unsigned int flip_j_to_k_bits (unsigned int n,unsigned int j,unsigned int
k)
{
2,3,4.. i think just one change
needed int t2=(1(k+1))-1;
On Fri, Jun 10, 2011 at 10:22 PM, Vetri Balaji vetribal...@gmail.comwrote:
int flip(int j,int k,int n)
{
int t1=(1j)-1;
int t2=(1k)-1;
t1=t2^t1;
return n^t1;
}
correct me if im wrong
On Fri, Jun 10, 2011 at 10:09 PM, Kunal
thanks!!
On Wed, Mar 23, 2011 at 8:25 AM, Anand anandut2...@gmail.com wrote:
Thanks!!
On Tue, Mar 22, 2011 at 7:11 PM, D.N.Vishwakarma@IITR
deok...@gmail.comwrote:
thanx...
On 3/22/11, Himanshu Neema potential.himansh...@gmail.com wrote:
-- Forwarded message --
is there any other books that can help in placements??
On Wed, Mar 23, 2011 at 9:25 AM, Gaurav Saxena grvsaxena...@gmail.comwrote:
Thanks a lot.
On Wed, Mar 23, 2011 at 8:41 AM, Vetri Balaji vetribal...@gmail.comwrote:
thanks!!
On Wed, Mar 23, 2011 at 8:25 AM, Anand anandut2...@gmail.com
