SortDouble Implementation

Video placeholder
Loading...
View Syllabus

Skills You'll Learn

Suffix Tree, Suffix Array, Knuth–Morris–Pratt (KMP) Algorithm, Algorithms On Strings

Reviews

4.5 (1,058 ratings)

  • 5 stars
    66.82%
  • 4 stars
    21.36%
  • 3 stars
    7.65%
  • 2 stars
    2.36%
  • 1 star
    1.79%

NR

Oct 18, 2019

Very well put together course. Challenging but understandable. I highly recommend you stick out. If you get stuck check the forums there's lots of helpful things there. Time well spent!

RS

Jul 23, 2023

I only wish I could get an 'gold-standard' sample of the programs I wasn't capable of writing after course completion, so I can see where I made my mistakes.

From the lesson

Constructing Suffix Arrays and Suffix Trees

Taught By

  • Placeholder

    Neil Rhodes

    Adjunct Faculty

  • Placeholder

    Michael Levin

    Lecturer

  • Placeholder

    Pavel Pevzner

    Professor

  • Placeholder

    Alexander S. Kulikov

    Professor

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.