@Yaseen Mollik Hi, buddy. I was gonna ask you, for this algorithm class. is there an entire class of coursera algorithm from the roughgarden team, too?
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
Thats exactly what I was shooting for! Nice logical flow and immersive. Kudos
This is great! Wish more people saw it
You are a legend!
Thank you - super useful explanation
great content, thanks for this.
explanation is bit complex only in this video
very clear explanation, better than other videos on this algorithm
Very clear explanation, but please explain the mystery behind the 7 @25:28. Its not very intuitive.
Check the followup video - "3 5 On log n Algorithm for Closest Pair"
@Yaseen Mollik Thank you!
@Yaseen Mollik Hi, buddy. I was gonna ask you, for this algorithm class. is there an entire class of coursera algorithm from the roughgarden team, too?
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
that can be done as the last step when the final result is returned, becasue square root is one on one and strictly increasing.
for calculating delta, I would just use abs(x1-x2) + abs(y1-y2), we don't need accurate euclidean distance for comparing distances.
It's not that hard to explain it with an example smh
Clickbaity title: I thought this was going to be a video on a logn solution