Recently, Sadakane~\cite{Sada98b}
proposes a new fast and memory efficient algorithm
for sorting suffixes of a text in lexicographic order.
It is important to sort suffixes
because an array of indexes of suffixes is called {\it suffix array}
and it is a memory efficient alternative of the suffix tree.
Sorting suffixes is also used for the Burrows-Wheeler transformation
in the Block Sorting text compression,
therefore fast sorting algorithms are desired.
In full-text databases, of course the length of texts are quite large,
and this algorithm makes it possible to use the suffix array data
structure and the compression scheme for such larger texts.

In this paper, we compare algorithms for making suffix arrays
of Bentley-Sedgewick, Andersson-Nilsson and Karp-Miller-Rosenberg
and making suffix trees of Larsson
on speed and required memory and compare them with our new algorithm
which is fast and memory efficient
by combining them.