cool!
On Sep 5, 11:09 am, Dufus wrote:
> Tryhttp://en.wikipedia.org/wiki/Fourier_division
>
> _dufus
>
> On Sep 4, 10:36 pm, ankur aggarwal wrote:
>
> > Write an algorithm two divide two extremely large numbers, which cannot be
> > stored in an int, long int, float, double etc. Find the remain
If you can use a library search for GMP or GMPQ and related (depend on
the numbers domain ) .
Denis
On 4 Set, 19:36, ankur aggarwal wrote:
> Write an algorithm two divide two extremely large numbers, which cannot be
> stored in an int, long int, float, double etc. Find the remainder and
> quot
Try http://en.wikipedia.org/wiki/Fourier_division
_dufus
On Sep 4, 10:36 pm, ankur aggarwal wrote:
> Write an algorithm two divide two extremely large numbers, which cannot be
> stored in an int, long int, float, double etc. Find the remainder and
> quotient .
--~--~-~--~~---
Just mimic long division.
On Sep 4, 12:36 pm, ankur aggarwal wrote:
> Write an algorithm two divide two extremely large numbers, which cannot be
> stored in an int, long int, float, double etc. Find the remainder and
> quotient .
--~--~-~--~~~---~--~~
You receive
