วีดีโอ

In the last slide, did you mean to say"what to do if stack is full upon push?" or am I missing something here?

Ausgezeichnet! Vielen Dank und weiter so!

I really like how you took your time to teach the topic. Thank you

love this!

great content

thanks what's an explanation !

Sehr schönes Video ! Danke dass du dein Wissen mit uns teilst :)

all these math notations in order to learn or know them, I should learn discrete mathematics & proofs ?

thank you so much

Thank you proffesor ❤

🎉🎉Thank you very much for Big information ❤

As a "brasilien" who knows english and some of the most used words in german, i really could follow this video and understand monst of it. SUPERLIKE

Thank you

35:42 I think we want to write something like "C = parallelPrefixSums(B)" and "if B[j] == 1 then S[C[j] - 1] = A[j]" in order to distinguish between the result of computing the prefix sum and the original bitvector.

Nicely done explanation

Thank you for making a video where you actually explain how something works rather than rattling off what you know at 300 WPM to make it clear you don't care whether the viewer actually learns anything or not the way every other video on TH-cam about this topic that is not given by a university lecturer does.

This is fascinating, but how to eliminate the overlaps which you are talking about in 9:03 ?

😳

What I should I read before this course

do you have a good way for practicing for competitive programming?

Hi there, lovely video, I was wondering if you would ming sharing those links regarding the explanations of the other "tricks" employed to make timsort very fast, im most curious!

God bless you.

this is so simple but elegant, really brilliant ! thank you so much for sharing

About the quiz in the last minutes, as you did not mention wether it is inefficient parallel prefix sums or work efficient parallel prefix sums, I believe both B and C are correct answers.

no subtiles...such a pity

Liked your sessions. Would like to know more about efficient algorithms.. What books/blogs/videos do you suggest ?

Let me see if I got the Idea "To understand this is IMPOSSIBLE, but You cannot say impossible without saying POSSIBLE" . P[0..j]= IMPOSSIBLE ; P[2..j] = POSSIBLE ; fail[j]=8

I think an expression parser might be a nice text string algorithm.

I think the trick you explained also works if we first recurse on every other suffix (this leads to a better constant factor), so it must be a different reason/property of DC3 splits on 2/3 of the suffixes.

Great video thank you sir

pr໐๓໐Ş๓

thank you very much

THANKS!

Because of the defination : "A→B" = “B∨ ┐A” , we can get some slightly different equivalent formula 1. "┐A→B" ＝ “B∨ A” 2. "┐A→ ┐B" ＝ “┐B∨ A” 3."A→ ┐B" ＝ “┐B∨＝┐A” And here is my prove: ┐A∨A //always holds ∵ A→B //when A is true, B is true. //when A is false, ┐A is true (at this point, we don't need to care about B) ∴ A→B = ┐A∨B

awesome explanation!

Thanks Bro

Thank you so much!

thank you so much.

proportional to d

minute 29:16 if B[j] == 1 then S[Prefix_Sum_B[j] - 1] := A[j] Am I correct?? B array does not have only 0's and 1's after runned prefixSum, then the if clause could be wrong ...

Thank you so much!!

Thank you so much

Was stuck on coursera for understanding this algo from last one day! You made it look quiet simple tbh. 😅

shouldn't the pattern be amended before the text in kangaroo LCE data structure?

how we can edit dark background please