Discover the new graph theory algorithms course: inscod.com/graphalgo 🔴 / \ 🔵-🔴 | | 🔴-🔵

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

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

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

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

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

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

Very well done video. I appreciate the care and quality.

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

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

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

Exactly what I was looking for Thanks !

Great explanation ! Underrated 100%

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.

This is some high quality material. Really appreciate it.

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.

Best explanation of karatsuba algorithm.

Thank you for this video. Keep growing. It would be so great if in future you plan on making a course on data structures & algorithms- would probably be something to watch out for whenever computer geeks open youTube.

thank you!! best explanation of the concept imo

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

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.

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

Just wow! Thanks man... Keep up the good work!

this video saved my life! thanks

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)

Brilliant video. Thank you so much

This tip seems very helpful. Thank you for sharing

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

Never knew about this,might come in handy Thanks :)

Great explanation, Thank you

Amazingly clear

great explanation thanks alot for saving the day

Brilliant explaination

amazing explaination bro!

Amazing explanation

teaching can't be better. thank you.

Thank you this is so helpful :)

With quantum computer memories sometime in the future, if read only quantum memories could be invented, then huge indexed table could be used for instantaneous results. For single value function like trig functions, read only index tables would have advantage of single clock speed and absolute accuracy, as it is my understanding that different approximations have needed accuracy for only portions of the number space.

Subscribed Sir,Amazing work

informative, thanks

Nice man 👍 keep up the good work

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

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

Thank you!!

hey amaizing video but i dont get it why in the time complexity calaculate the sum require o(n) it all sum why not o(1)? i mean at 8:20 at the below statement ?

wow this helped so much thanks youuuu!!!!

very great explanation!

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

Great content. Thank you

wow , its always worth watching

Amazing Video!

This is helpful .. Thumbs up!

very helpful video, thanks heaps

Fantastic as usual! May I ask what program you use to do your videos?

This channel only need playlist clarification and it is perfect!

fascinating!

beautiful ty

Really really useful

Hi bro, that's realy high quality content I love ❤❤❤❤❤❤❤your accent daaam. Keep doing, Love from India🇮🇳🇮🇳.

is there another way to get 3 multiplications?

Beautiful!

awesome man immediately subscribe to your channel

Thx a lot

thank u a lot bro .... best video ;)

Aw this is amazing

nice job

How does this work IN PRACTICE for standard 64 bit binary machines? Is there REALLY a savings? Or are much larger numbers (256 bit) needed for a practical improvement? Has this ever actually been implemented into processor microcode? If so, how did it work out?

I was wondering from some time ago if Toom-4 is equivalent with Karatsuba , from a complexity point of view, but that looks a bit impossible. Lately , I was able only to come with this. Considerring Toom-4 and also Toom-4 added those two terms multiplications (the ones from middle ), which are more like K-idea, only with two more multiplication comparing too Toom-4. (so we got 4+3 vs 4+5 complexity dilema). those 5 multiplications terms computed are all following some simple rule for product of 2 coetients and other 2, no matter which one of the 5 mult term we chose. So we might be able to reach to the conclusion that we can find the method Florin-4, Florin-8, etc, no so sure about its complexity thow so this may be just some joke offered by me to anyone wish to verify its complexity. Thank You, I like these style of videos on KZfaq! ^_^ P.S. digging this out i was needed to reformulate the K-idea , both with Toom one, by switching from geometric progressions to something more oriented on adds n diffs instead coetient products that looks the same to diffs that look the same. But this is a bit too complex to me, a bit hard to get the job done, need meds 2 times a day in any case, I mean only to be able to put these here, for example. Thank You! :-)

Amazing

thanks

The best channel

Pardon me but i m still confused how does exactly it reduces the time complexity than the old way, i see a lot of arithmetic in this method too?

I can't understand why we store n // 2 in the variable half , I know it gives a wrong answer if we don't do that but why ?

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! :-)

I wrote a code similar to this but while running it for inputs of 8 digits and more, I'm getting recursion max depth reached error. Any idea how to solve this?

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

It should be (a+b)(c+d) and you solved for that only but you have written (a+c)(b+d) at 6:10

Why calculating the result takes O(n)?

Thank u sir

سبحان الله والله عرفت accent تعك دزيرية 😂 Anyways, thanks for the information it was really helpful, keep going 💜💜

nice man

goated video

That algorithm is used to multiply big Matrix right?

Need more such

Did not understand why there's O(n) ? All the operations are O(1)

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.

you are super awesome

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...

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

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

cool ♣

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

u da goat no bap

thanks a loot

PayPal link for paying back for this amazing explanation?

gooddddd

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

How u got 5,8

Calculator was made for the math💀💀

that doesn't look quicker or simpler