[bra[cad[abr[ $$[rac[ada[braintegers sa[ index figure mapping of tri-charactersthe resulting array that is formed for and the resulting suffix array that is computed recursively step compute the suffix array for this is easy to do because [ - [ - [ is[ - [ ] [ - [ ] [ -since our recursive call has already sorted all [ -]we can do step with simple two-pass radix sortthe first pass is on [ -]and the second pass is on [iexamplein our example [abr][aca][dab][ra$from the recursive call in step we can rank the suffixes in and figure shows how the indices in the original string can be referenced from the recursively computed suffix array and shows how the suffix array from figure leads to ranking of suffixes among entries in the next-to-last row are easily obtained from the prior two rows in the last rowthe ith entry is given by the location of in the row labelled sa[ the ranking established in can be used directly for the first radix sort pass on then we do second pass on the single characters from susing the prior radix sort to break ties notice that it is convenient if has exactly as many elements as figure shows how we can compute the suffix array for at this pointwe now have the suffix array for and for the combined group and since this is two-pass radix sortthis step takes on [bra[cad[abr[ $$[rac[ada[braindex in sa[ sa using ' indices rank in group figure ranking of suffixes based on suffix array shown in figure