Video

This is art, Thanks for sharing this <3

who came here from leetcode

worst course Your students are unlucky to have you

perfect!!!

How to solve the program in this

Scary forces of evil 😂

😢😢

i was screaming in my head how we have four multiplications with 1/4 as many single digit multiplications as x*y so how is it any better.. as soon as you wrote out (a + b) ( c + d) near the end it clicked.... this simple product minus ac and bd gives us our ad + bc... and this is the entire reason why karatsuba hits that juicy O(n^log_2(3))

So Barack Obama is now a Professor?

Great lecture thank you :) Don't know why people complain about speed when they can change playback speed. For me, it was too slow and I watched at 1.25x

That grid logic is so good!

man. the transcript of the video was entirely taken from Algorithms Illuminated part 1. even the word "inscrutable" hahahahahah

The power Dr. Roughgarden holds is impeccable, the smirk at the beginning makes me weak

No of videos : 75 Average length of video : 15 minutes, 55 seconds Total length of playlist : 19 hours, 54 minutes, 57 seconds At 1.25x : 15 hours, 55 minutes, 57 seconds At 1.50x : 13 hours, 16 minutes, 38 seconds At 1.75x : 11 hours, 22 minutes, 49 seconds At 2.00x : 9 hours, 57 minutes, 28 seconds

Hello! I really like your book and your CZcams content. Thank you! I wanted to ask if I can take your video or text from the video and translate it into Russian. Thanks for reading!

Where can i find the course slides?

It's not that hard to explain it with an example smh

you are seriously the best, THANK YOU :)

Thanks so much

we were going well, until the recursion and the agebra started, I got completely lost in that part.

Taking the base cases into consideration, we can have a max of 3 points on the left and a max of 3 points on the right, so the worst-case scenario for the ClosestSplitPair() function is to loop over 3X3=9 times to find the closest-split pair, which is a different number from the 8-square method. Where is the missing point? (no pun intended)

Dear professor, at 9:38 in the video you said, "We can construct G_rev,. an obvious optimization is to use the same Graph G but to go upwards in arcs". This is slightly confusing to me, When I represent a graph as an adjacency list, for a given vertex I only have access to vertices that are adjacent to this. How can we go upwards with this representation. When I implement SCC algorithm, I usually read the input edge list and construct both G and G_rev, is there a better way to do this?

great content, thanks for this.

The lecture videos are excellent professor. Just wanted to know if indeed the probability that zi and zj are compared is exactly 2 / (j - i + 1), "always"? The probability is upper bounded by 2 / (j - i + 1) right? For example consider an array of size k (k > (j - i + 1)), such that it contains all elements from zi to zj, passed recursively into quick sort. The probability that zi and zj would be compared at this stage would be 2/k (< 2/(j - i + 1)) right?

excellent! thanks a lot!!

Beautifully explained!

Amazing explanation

dunno if starting the book with something so frustratingly unintuitive is a great way to make people feel invited into the world of algorithm analysis. i spent most of this chapter feeling stupid.

confused in the book it says each "row" takes 3n operations, not 2n, because it takes "at most 2" additions for each carry. what does that mean? each carry is only ever a single addition. so the video says 2n per row seems right and the book is wrong or am I missing something obvious

I first tried his Part 1 (The Basics) book but found it too complicated to figure out algorithms. Then cam here with that hope his videos are better and help me to understand the book better, but now I see he talks as fast as a human being can talk (I don't know why!).

Great Video ! but upon which criteria is the padding happening in 3:30? Why did we add 4 0's to the first, none to the second and 2 to the last?

If n = 4 the number of levels j = 0, 1, 2. The maximum level is 2. But log n base 2 + 1 ≠ 2.

Thank you for the excellent series!

Thanks a lot.

Just a heads up if anyone else is attempting to find the first video for Chapter 6 - Linear-Time Section for Algorithms Illuminated: Part 1 The Basics, this is the first video for that chapter. I know this video has "8 1" in the title, but this is the same material that is being discussed on page 159, for the 4th Printing, 2021 version of the book.

Amazing video sir ✌✌

it doesnt work with 2 digits multiple 2 digits, does it?

it doesnt work with 2 digits multiple 2 digits right, does it?

Fantastic

Nice

timmy rg

I need to switch my major to EEE instead of CSE.

very good explanation but the formula: distance = square root((xi-yi)**2 + (xj-yj)**2) is wrong, you should take the square root of the sum of the differences between the x_coordinates and y_coordinates

Thanks a lot!

I want to know what Strassen was eating 😅

Fascinatingly counterintuitive algorithm, but difficult to optimize in reality. Eg. if a,b,c,d are 32-bit integers then (a+b) and (c+d) are 33-bit numbers, and their product is a 66-bit number, requiring extra operations to track, etc.

Now we know what is the level of Stanford