, chandy jose paul jpchaa...@gmail.com wrote:
Y are u guys complicating things.Its as simple as this
x=a-b = (a/b)*b + a%b
On Tue, Jul 12, 2011 at 1:18 AM, Dave dave_and_da...@juno.com wrote:
@Aditya: Since 124 is a 3-digit number, I think it would make more
sense to use the 3-digit
dnt worry about that write a code in which initialy 2 ptrs .move 1 ptr 2
nodes at a time and other ptr 1 time.when the first ptr reaches end then
seconf ptr will be at middle
On Mon, Jul 11, 2011 at 6:15 PM, vaibhav shukla vaibhav200...@gmail.comwrote:
i have considered it (n/2+1)th
and
use a heap u ill be using a min heap ie the Nth element will be the root.So
when u find a element compare with the root if its greater then replace the
root with this new number and call heapify function
On Mon, Jul 11, 2011 at 4:43 PM, abhijith reddy abhijith200...@gmail.comwrote:
You can use
Y are u guys complicating things.Its as simple as this
x=a-b = (a/b)*b + a%b
On Tue, Jul 12, 2011 at 1:18 AM, Dave dave_and_da...@juno.com wrote:
@Aditya: Since 124 is a 3-digit number, I think it would make more
sense to use the 3-digit 10's complement of 46, i.e., 954. Then 124 +
954 =
