Відео

Good day, Sir. I am confused with the phrase structure of L4 and L5 in this video. L4=string w has four 0 's , L5=string w has two 0's and two 1's. Both phrase structure is the same (string w has (how many) 0's/0's and 1's) . L4 we accept ans with not only four 0 like 110000,0011100,... while for L5 ,why the string should be exactly or has only 0011 / 1100, answer like 111110011,000011(also got two 0 and 1) is not considered. Hope can get some inspiration from Sir. Thanks!

bro can u increases the volume . just by 25%. im on my laptop. trying to finish ur playlist in 3 days.

great explanation. IT finally. makes sense :)

Omg I have been searching for an hour and finally found what I needed so much, other videos don't show this solution thank you so much you are a saviour ❤❤

Is the bucket size arbitrary? Here you have 4 entries per bucket, in my course they use examples of bucket size 2. Is it just arbitrary and therefore should be clear on a potential question?

Great video, stuck on this for ages

Thanks mate

Very clear ✨️❤

I know this video is 4 years old now so this is a Hail Mary, I’m a bit confused on why the case where T is less than half the sum and T is more than half the sum need something different added to them. Isn’t the relationship between the two sets symetric so to say. Meaning that maybe the partition wont be the set that makes subset sum true but there will exist two sets that you can partition regardless no ? Perhaps im getting confused but id appreciate if you can give some insight

hi! great video, thank you very much! This implementation does not support pressing multiple keys at the same time right? Like pressing up and right at the same time would not work because you break out of the switch statement as soon as one of the conditions is met.

Very helpful, thank you

Straight to the point and fantastic explanations..I finally understand this topic

Thank you so much ! Automata theory test in a couple hours ! I was lost then I tried looking for videos sorting them by "most recent", and I am so happy I fell on your video !

Curious as to how phenomena like tornadoes or fire seem to match the criteria

Hello, hope you're doing well I would like to know if it's possible to get the slides for this courses ?

🙏 Exactly what I need I'm trying to make a recreation on Unity I will also leave a link to your video in the comments to the code. Thanks!

in L8 i think its wrong ! if the input is : 10010011 this should be rejected but in urs its accepted

In the proof for the upper bound (big O), is it necessary to include n = 3 in the base case? Would using only n = 2 still be valid? It seems it would still be valid because the base case n = 2 and the inductive step implies the truth of the n = 3 case (I think). Unless I am missing something

Thank you for your patient explanation! It saved much of my time.

Did he ever mention why he named it Tierra?

thanks man for the explaination

This is awesome stuff!!! thanks for the effort!

20:38 Thank you so much!! Saved my grade in my algorithms course :)

i havea problem with the invariant of the outer loop the invariant isnt corrent for i = n-1 which is the last iteration take as example an array of size 4 [3,1,2,0] n-i will never equal 0 since i only iterates until n-1 so in the last iteration (where i = 3) the invariant would state the the elements from the 2 to 4 are sorted, excluding the first element.

cool!

could I have the figures in this explanation? Do you mind if I use these figures in a presentation?

Amazing video Chris, keep it up with the cool content.

How this differ from a subset sum problem (that is supposed to be np problem, and therefore not able to be executed in polynomial time) ?

This generalised code looks like merge sort.............

Thank you so much.

thank you so much

Planning to implement this, right into my toy DB project. Thanks a lot. Could you also shed some light on how to organize the buckets or bucket pointers? Should they be contiguous pages or something like OS page tables?

cool , I appreciated

Hey , im really struggling with laying out the correct DFAs for a given condition of inputs , Can you please help and give some idea as how you approach the construction of a particular DFA regarding some condition . Thx

Superb work, Chris! I was hooked for the entire lecture, from start to finish. As a master's students, it is often frustrating how little some professors care about making sure the students learn - sometimes, it feels like the tests we take are more about testing the student's ability to google parts of the subject and learn by themselves rather than testing the student's ability to properly learn from class. It is easy to raise the question - does a master's diploma even prove that much when a lot of us aren't learning directly from the master's program and its professors, but from UA-cam videos? Videos like these are what make the world a better place - sharing knowledge for free with little to no compensation. Thank you so much for stepping up to do the job that my bitter and overpaid professors wouldn't.

So nice video! Good job man you saving me in my exam

great video ! but at around 12:00 , you made a split. I didn't get how can we select how to split the pointers between the old bucket and the new one. can you help please

great video thank you 🙏🙏

This is amazing explanation.

Hi, what textbook are you using for these lectures?

Nice start

Thank you for the video. Professors always assume that everything about induction is obvious and they always confuse me by leaving out steps. Your detailed solution and paced answer really helped me understand the concept!

Great series! So happy I came across them, thank you🙏

This is hands down the best explanation on how to prove the closed form of summations. I always struggled to understand why the closed forms were the way it were, and like you, my brain is a "non-labeler", so I remember the ideas better than just memorizing the concepts. Thanks!

Hey Chris, I have a very similar problem I'm solving (what I would call interval cover too, but for intervals of varying real length) I was wondering if you'd have time for a quick chat about the problem? :)

please reply, is runtime of this algo nlogn ?

perfect! Thank you!

Why do we need n >= n_T?

Thank you. People need to learn about this. Energence from simple systens is HUGEEEEE. And it also can be reason to believe in evolution

This was great!