Hi,
I've just learned about the water crisis and would be grateful if you could
spend a few minutes to help solve it:
https://waterforward.charitywater.org/GSkEnwJl
Thanks,
Manikanta
--
the charity: water team
WaterForward, 387 Tehama Street, San Francisco, CA 94103, USA.
Click here to
Check this out, it works in O(n);
int i = 0;
int j = n-1;
while((in j= 0)(ij))
{
if(a[i]0 a[j]0)
{
swap(a[i],a[j]);
i++; j--;
}
else
{
Its a const member function, you cant return reference to the object.
Const member function never allows you to modify the data until unless its
a mutable. So here we are passing the reference to object which is
modifiable, it conflicts with the const member function property.
So the compiler
by placing the const keyword at the end of the function
signature.
In case you want to make the this pointer volatile, u can do so by
placing the keyword volatile at the end of the function signature.
On May 28, 12:05 am, Manikanta Babu manikantabab...@gmail.com wrote:
Its a const member function
Azhar,
Thanks for the answer. Its a great explanation.
Cheers,
Mani
On Mon, Feb 13, 2012 at 7:50 PM, Azhar Hussain azhar...@gmail.com wrote:
C, standard says which operand belongs to which operator. It does not says
which one gets evaluated first.
Why it is returning 8 is because of
Congrats buddy.
Can you please post the interview questions here. It helps.
Thanks,
Mani
On Thu, Sep 22, 2011 at 6:22 PM, abhishek abhishek.ma...@gmail.com wrote:
congrats dude
hope u will be well connected with this group and help others to
achieve their goals
On Sep 22, 8:29 am,
The Algorithm Design Manual is the best book you can refer. But its not for
beginners.
Cheers,
Mani
On Tue, Sep 6, 2011 at 4:09 PM, siddharam suresh siddharam@gmail.comwrote:
@neha: there is site calledhttp://library.nu
register there, u'll get majority of the books.
Thank you,
Sid.
Take two pointers ptr1 and ptr2,
ptr1 should move 4 nodes at a time
ptr2 should move 3 nodes at a time,
thats it when the ptr1 reaches the end the ptr2 will be pointing to 3/4th,
same way for m/n th node. But this works best for even number of nodes in
list.
For odd numbers we need to compromise
0x20 means its a hexa decimal number and the decimal value is 32.
Calculation is : 16 power of 0 + 2 * 16 power of 1 = 32
Thanks,
Mani
http://www.sanidapa.com
On Tue, Jun 21, 2011 at 12:43 PM, Srinivasan Sivaramachandran
21.sr...@gmail.com wrote:
Hexadecimal representation, 20h equals 32d
Hello Sunitha,
Can you please stop posting these kind of things into this google group.
Please go to some other appropriate group.
Thanks,
Mani
On Fri, Apr 8, 2011 at 3:56 PM, SUNITHA BUSETTY
sunitha.buse...@gmail.comwrote:
hot lipkiss
@Saurabh, Sorry buddy, I was trying with g++ compiler, i just tried with gcc
and its throwing an error 'error: initializer element is not constant'.
I apologise for the mistake.
Thanks,
Mani
On Fri, Mar 18, 2011 at 11:38 AM, saurabh singh saurab...@gmail.com wrote:
@Manikanta Babu.
Dont say
@Dondod is right.
It works perfectly. Because printf returns the number of characters printed
so n will be initialized with the number of characters. You can try out this
simple program. I checked its working perfectly.
Thanks,
Mani
On Fri, Mar 18, 2011 at 9:59 AM, .bashrc saurab...@gmail.com
12 matches
Mail list logo
