How can we multiply large integers quickly? (Karatsuba algorithm) - Inside code

When I was in university I was assigned to implement this algorithm, and I struggled to understand it.

goated video

this is a very well done video, the animation and the color palate are really smooth and the explanation is clear as day.

Best explanation of karatsuba algorithm.

thanks for the video explaination.
also, note that 1.58 is read as one point five eight, not one point fifty eight.

is there another way to get 3 multiplications?

beautiful ty

informative, thanks

Great explanation ! Underrated 100%

Brilliant explaination

Amazingly clear

Brilliant video. Thank you so much

teaching can't be better. thank you.

Amazing explanation

u da goat no bap

thanks a loot

Thx a lot

How to solve it using array by storing two numbers in 1D array with help of 2D array

great explanation thanks alot for saving the day

Avik ims pimro whatever you teamch

Subscribed Sir,Amazing work

thanks

Aw this is amazing

Amazing

amazing explanation,short and brief...made the concept easy for me. thanks 😍

Great explanation, Thank you

How do we do this if we have odd lengths of numbers?

thank you!! best explanation of the concept imo

Four minutes of algebra is not a meaningful demonstration of how to do it. I want to know how it works with more than tens . The essence is already understood.

nice job

nice man

This begs to be a homework problem in recursive LISP. Using binary numbers. LOL

wow this helped so much thanks youuuu!!!!

Fantastic and easy to understand tutorial! Just want to point out that the last line of code might not work in the case of an odd number of digits, since you calculate half with n//2.

Great platform and very helpful!! Keep Going! One of the rare channels which explain algorithm design in such depth...

His speech melody tells 'it's all very simple, seeee?' - My brain sounds drop to 40hz.

any uetian present

Nice video but i don t understand why do we need this. Cant we just multiply the numbers? Initially i thought that the method will be for that numbers that when are multiplied are giving a very large number that doesn t fit into long long or double.

If you talked a bit slower and clearer would be a 10/10

amazing explaination bro!

Thank you!!

One minor thing that is missing here is how to Actually calculate big numbers that don't fit regular programming primitives as Int or Double

I don't get it, why n is 2?

An algo optimisation idea that can be inspired by the hardware predication techniques, applied to soft data numbers to be multiplied, arraies to be multiplied, others may too, I think that may give us something to think about. Never tested nor verified by me, sorry! :-)

Some feedback about calculating the time complexity

you say, the return statement has complexity O(n) but if you observe closely, the whole return statement is filled with O(1) operations,

I think the function "ad_plus_bc" has complexity of T(n/2)+O(n), because it has a subtraction operation, subtracting/adding has complexity of O(n)

The overall expression of complexity is correct.

T(n) = 3T(n/2) + O(n) + O(1), where O(1) can be ignored in the presence of O(n)

I have a fat expensive algorithm book in my hand that could not even explain how x became a*10^(n/2) + b. Yet it only took you 10 seconds to explain it...