利用向量实现对字符串的快速排序  

Using Vector to Realize Quick Sort of String

作　　者：英锋[1] 冯玉芬[2] 

机构地区：[1]唐山师范学院计算机科学系,河北唐山063000 [2]唐山师范学院数学与信息科学系,河北唐山063000

出　　处：《梧州学院学报》2008年第3期31-35,共5页Journal of Wuzhou University

摘　　要：快速排序是交换排序的一种方法,是对过程简单的冒泡排序的一种改进算法。向量是C++STL的重要一员,是可以容纳多种类型的相同实体,可以自动伸展,给一些不确定数据量的容器工作带来很大的方便。string是一种自定义类型,是针对方便字符串而设计的,该文给出用向量实现对字符串的快速排序的操作,并计算该算法的时间复杂度。Quick sort is a kind of exchanged sort program, and it is a kind of method that reforms bubble algorithm which is a simple sort processing. Vector is the important member of the C＋＋ STL, and it is the same entity which contains many types, stretching automatically, and bring the container work which measures to some indetermination data with great convenience. The string is a defined data type, designed for processing characters string conveniently. This paper explains the operation to realize quick sort by using a vector and analyses the asymptotic time complexity of the sort algorithm.

关 键 词：向量vector 快速排序 字符串 算法 时间复杂度 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论]