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

NB: This video is ad-free, you can choose to support Inside code by purchasing one of the courses above or dropping a super thanks!
NB2: Discounts of courses above are permanent

[insidecode]

🔴
/ \
🔵—🔴
| |
🔴—🔵

[Paul-vgvc]

I believe there's a typo at 6:01 - the fifth line should say "(a+b)(c+d)-ac-bd"

[markd]

Jeez, you explain this very well. You don’t explain material in a generic way. Also, I love the animation.

[georgia]

2 minutes in and i already have a much better understanding. absolute legend thank you!!

[gimmametdeboys]

Really liked the tree visualtion, made it so much easier to understand.

[richardtobing]

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

[ryansamarakoon]

This is amazing!! I learnt so much not just about the algorithm, but key concepts like merge sort, masters method and more. I'm waiting for the day you blow up 🔥 def sending this one to my friends

[richardpro]

We need more such videos
Your channel is getting addictive ❤

[pirateboygaming]

Best explanation of karatsuba algorithm.

[markocastillo]

This is some high quality material. Really appreciate it.

[yaswanthnani]

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

[kshitijzutshi]

Hi, PLEASE create more videos like this and Also add videos to playlist for easy lookup. Really appreciate it. Algo/problems related to Data science would be great as well.

[someoneunknown]

I never knew that there is another algorithm to multiply. Thanks for increasing my knowledge 😍😍🥰🙏✌️

[gorantlakarthik]

Apart from good explanation. The entire presentation is also so satisfying and I can see u put a lot of work behind it. Do more of them we will keep supporting you sir.

[saqlainsajid]

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)

[harshmangalamverma]

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

[modysy]

This tip seems very helpful. Thank you for sharing

[antoine]

Exactly what I was looking for
Thanks !

[BELLAOUAR_Mahmoud]

Ur explanation is very clear i hope to make more videos about unknown topics in computer science
well done bro .

[polishane]

Thank you so much, been looking for ways to make my multiplication more efficient