Suffix Array Construction

Udi Manber & Gene Myers, 1990

O(n log n)

A suffix array is a sorted array of all suffixes of a string, providing a space-efficient alternative to suffix trees. Originally introduced by Manber and Myers in 1990, it supports binary search for pattern matching in O(m log n) time. The visualization shows all suffixes being sorted step by step using selection sort, with each suffix's starting index tracked alongside.