Jump to content

Long multiplication: Difference between revisions

m
→‎base 10^9: minor tidy
m (→‎base 10^9: minor tidy)
Line 3,966:
function bcd9_mult(sequence a, sequence b)
 
sequence c
sequence c = repeat(0,length(a)+length(b))
integer j
atom ci
c = repeat(0,length(a)+length(b))
for i=1 to length(a) do
integer j = i+length(b)-1
c[i..j] = sq_add(c[i..j],sq_mul(a[i],b))
end for
for i=1 to length(c) do
atom ci = c[i]
if ci>base then
c[i+1] += floor(ci/base) -- carry
7,820

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.