Since we need to divide so the quotient should be at least 1, and we need
greatest remainder, so we need the least no. which will give the quotient 1
upon dividing and that would be the no. you described.
Also you would have noted the greatest remainder would be floor(n/2)-1 .
On Thursday, 16
---
Can you give me the algorithm to add using the above c array in the way
desired in multiplication ( be careful about the way numbers are stored)
--
Thank You and Regards,
Nikhil Kumar
+91-9916343619
Product Engineer
Commonfloor.com
--
You received this message because you are subscribed
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Nikhil Kumar , Software Engineer @ Ciena Gurgaon.
B.E.( Information Technology ) ,
NSIT Delhi , 2007-2011
--
You received this message because you are subscribed to the Google Groups
=en.
--
Nikhil Kumar , Software Engineer @ Ciena Gurgaon.
B.E.( Information Technology ) ,
NSIT Delhi , 2007-2011
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe
Post your pair functions ..I'm sure you're wrong there!
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
