@abhishek its wrong as arr1 is just a pointer o int and sizeof(arr1)
will always be 4 bytes(size of a pointer) regardless of number of bytes
allocated to it on heap
On Tue, Jul 3, 2012 at 3:14 PM, Abhishek Sharma abhi120...@gmail.comwrote:
arr1 = (int *)malloc(sizeof(int) * ncols);
i dont knw read it in some paper.. most prob developer.
On Sat, Jun 30, 2012 at 9:56 PM, rahul sharma rahul23111...@gmail.comwrote:
these are asked for which profyl??developer or white box??
On Sat, Jun 30, 2012 at 8:03 PM, Amol Sharma amolsharm...@gmail.comwrote:
@sarthak :
oh bhai mere. kewal preorder use karke kaise tree bana dega???
On Fri, Jun 29, 2012 at 11:23 PM, amrit harry dabbcomput...@gmail.comwrote:
@bhaskar ur algo fails on this case (5+3)-(2+(3/6))
-+53+2/36
63/2+35-+
showing that 6/3 but actually it is 3/6
so i think it could be done by
it first calculates from right to left and then performs addition
so after a++ its still 4(with a promise to increment in next
statement). then ++a makes it 5. then further ++a makes it 6
now the addition phase comes into play value of a is 6 now so total
18 if it
rope data structure can be gud in such cases.. hashing may not be too
efficient as many url wud almost be same as mentioned by prakash. trie
is another option but i believe overhead in trie will be more...
correct me if i am wrong.
On Fri, May 18, 2012 at 11:33 AM, Ashish Goel
