watching this 3 hours before my algortihms final💀💀

@BelykToast

Жыл бұрын

same here, have my finals today🤣

@utsavmishra2644

Жыл бұрын

1 hour* 🙂

Great explanation, short, crisp and concise.

This is such an amazing video. The best one out there!

The formula for clockwise and counterclockwise is same, that’s a mistake I guess

Great explanation! at 6:37 Isn't O(nlog(n)) bigger than O(n)? The time complexity is O(n*log(n))

@insidecode

2 жыл бұрын

Yes I said it but made a mistake in the slide, thanks for noticing!

You are literally a GOAT

Nice explanation

Can we make a concave hull without checking the rotation condition

Very useful video, thanks.

@insidecode

2 жыл бұрын

You're welcome!

Is the graham scan drawing the convex hulls counter clockwise every single time or could it be that it'll draw the hull in the same way but just in the other direction (clockwise) ??

I have a case when i can not make work this algorithm: ((0,0),(1,0),(2,0),(2,1),(2,2),(1,1)), this is because (1,0) and (2,0) are collinear, but you need to process (1,0) first in order to get the correct answer, but, on the other hand, (1,1) and (2,2) are also collinear, but you need to process (2,2) first, because of this, it keeps giving me the wrong answer

I love your vedios, I need some suggestion for improving my resume, I need idea for projects.

@insidecode

2 жыл бұрын

In what field?

Genius

we pop

great, except your code is wrong🤡

@Hari_123.

7 ай бұрын

Do you have the code?...Can you share it here?!

@mariyka3474

7 ай бұрын

Code in video for algorithm. Works incorrect.