Finish of Linear-time pattern matching

Sdílet
Vložit
  • čas přidán 29. 09. 2011
  • Lecture 22 complete of Linear-time pattern matching using the Z-algorithm
  • Věda a technologie

Komentáře • 10

  • @akshaydamle95
    @akshaydamle95 Před 6 lety +20

    For future viewers: You can start at 16:00 if you've come here right after watching the first part. Cheers!

  • @lachlangro
    @lachlangro Před 4 lety +2

    I finally get the Z algorithm. Thank you.

  • @gujjua
    @gujjua Před 12 lety +3

    Very nice presentation on Z-algorithm, crisp and to the point.

  • @franco521
    @franco521 Před 5 lety +3

    It would have been nice from UC Davis to mention the professor's name, and perhaps the course name and number as well...

    • @tylertownsend6347
      @tylertownsend6347 Před 4 lety +6

      CS122a - Algorithm Design and Analysis taught by Dan Gusfield

  • @sanjusingh12
    @sanjusingh12 Před 12 lety +1

    awesome...

  • @franco521
    @franco521 Před 5 lety +2

    Favorite part was 20:00. Not gonna write any spoilers.

  • @king_has_no_clothskul8635

    uc davis great school.

  • @Michael10000
    @Michael10000 Před 4 lety +1

    I think he made a slight mistake by saying that x is not equal to p in the third case. It does not affect the algorithm to assume that, but x could be equal to the length of beta and be equal to p but not the next letter in the prefix of course.

    • @AltruisticHedonism
      @AltruisticHedonism Před 3 lety +1

      if x = p, then x = p would be in alpha when you computed alpha, I believe