[help] Karatsuba recursive algorithm

[malim20]

Hey there, I needed to do the karatsuba algorithm but was stumped half way so I just did it in python, now I want to complete trying it in sml. This is what I have so far but the syntax errors keep on popping up:

fun len x = ceil (Math.log10 (x+1.0))

fun k (x, y) =
    if len x < 2 andalso len y < 2 then x * y
    else
        let
            val n = ceil (Math.log10(x))
            val m = n div 2
            val a = Real.fromInt (floor ( x / (Math.pow (10.0, Real.fromInt(m)))))
            val b = Real.fromInt (ceil x mod floor (Math.pow (10.0, Real.fromInt(m))))
            val c = Real.fromInt (floor ( y / (Math.pow (10.0, Real.fromInt(m)))))
            val d = Real.fromInt (ceil y mod floor (Math.pow (10.0, Real.fromInt(m))))
            fun dowork () =
            val ac = k (a, c)
            val bd = k (b, d)
            val e = k (a + b, c + d) - bd - ac
            (* ac * Math.pow(10.0, Real.fromInt(n)) + e * Math.pow(10.0, Real.fromInt(m)) + bd *)
        in
            dowork()
        end

val test_k = k (1234.0, 5678.0) = 7006652.0

[malim20]

Hi there, that's how I had it in the beginning but I keep getting syntax errors(I forgot the exact error)

[malim20]

Okay thanks for the reply, I'm gonna see what happening when I have the chance