基于后缀数组的快速排序算法

A Quick Sorting Algorithm Based on Suffix Arrays

在搜索技术和各种流行的排序算法优缺点比较的基础上,给出了一种基于后缀数组的新的快速排序算法,该算法在时间和空间性能上均优于传统的快速排序算法;并在同等的条件下,用该方法与快速排序算法对相同的内容进行排序,结果表明:该算法特别适用于大文本的排序问题,可用于搜索技术和数据压缩中.

The authaors introduce a quick sorting algorithm through comparing with all kinds of sort al-gorithm based on suffix arrays and learning search technology. The algorithm is superior to traditional sort algorithm in time and space performance. If this method and traditional sort algorithm is used in the same condition and the same question, the experiments show that it is very suitable to tho 1 text and the method may be used in searching technology and data compression.