Відео

ATLA is the best show: fact

thanks for explaining soo well

Your explanations are very VERY clear ,thank you for the amazing effort you put in these videos !!!

Thank you very much!

Nice Work😉 Also Mention how thise algo Finds the pivot.

this topic is unbelievably, extraordinarily difficult for me. i hate this so much.

How do I build the graph with an edge that is only in one Subset ? since according to your example each vertex is connection to another vertex if they have matching edges that correspond to the original subset items .. ?

Explain the DFS Edge Classification in a short time, which is pretty good

Thx

I can not thank you enough. All of your videos are great and simple and the examples are very helpful. hopefully you don't get discouraged because of low view counts on these topics. thx again.

your the only person that made this make sense for me. It clicked in a different way though. It makes sense in code where you type an IF => THEN statement.The code will only execute when P is fulfilled; the output will be whatever Q is. On the other hand if P is never fulfilled then Q is never outputted. I guess im thinking of it as a type of "LAW" statement. it can only ever be tested when the P conditions are met; if they're not then the code sits their in the background. Maybe my thinking is flawed lol. sometimes an idea clicks and then I apply it somewhere else and my "reasoning" ends up false. Thank you for the lesson though this has been extremely helpful!!!

Best overview I've seen so far. Great work! Exactly what I was looking for

you are a hero

Thank you so much!

thank you so much

Lost me at the star

these videos deserve more subs!

Thank you so much for these examples! Super helpful, I barely understand my professor's lectures but this made it very clear :)

what a beautiful and useful this data structure is .. i can think of dozens of applications for this

Why didn't we do log3 + log n² Replace the log3 with Log n…? Is it because we took greater value of n

youre great!!

nice work!

for an array A, of size N and containing N elements: for int i from 1 to N-1 int j = i while j > 0 && a[j] < a[j-1] swap(a[j], a[j-1]) j--

So satisfying 👍

Great series, superb speaker!

i just finished going through the entire asymptotic notation playlist and you officially saved my life. i was struggling super hard with this topic and now it feels super easy. :)

we need to prove omega (log base4 (n)) so why did you not take log base4 (5n) instead of log base4(4n^2) as we need n not n^2 to prove?

Spend an hour looking for a youtube video for this topic. Nicely done !!!

You know who else started CSE 2331?

you are a hero

Thank you!

I dont understand why did we write 3n on the right side of the inequality instead of n^2? Isn't n^2 the expression that increases the most as the function goes to infinity? I've been examining such examples for the last few days, but I couldn't understand the logic. I understood big o a little, but I couldn't understand omega at all.

Thanks for your effort on making this lesson !

A life saver 🫡

nick catching strays lol

great video!

def insertionSort(array): for step in range(1, len(array)): key = array[step] j = step - 1 # Compare key with each element on the left of it until an element smaller than it is found # For descending order, change key<array[j] to key>array[j]. while j >= 0 and key < array[j]: array[j + 1] = array[j] j = j - 1 # Place key at after the element just smaller than it. array[j + 1] = key

in 2:07 , isn't that n*logn

bro already better then most of the kings

Super easy to follow and just what I needed for my algorithm course, thanks so much!

thank you man

perfect example and nice explanation sir

Where can I find more lectures

is it not a rule that in a clause we cant have 2 literals the same as here XA is same for last two clauses

What app do you use for drawing?

At 14:42, couldnt you just substitute the terms Xa represents into the formula to get 3-CNF?

very underrated indeed. one of the best out there

God bless you for these videos🙏🙏🙏

You're goated

why is it theta of n ^2 not big o or anything else