可用此法实现快速分类。It recursively does this until the 2 parts are so small that determining which part goes where becomes a trivial matter. After the vector is split and sorted, they are combined to for the original, in sorted order. -This is a quicksort algorithm with can be used with any data type that can make use of the < operator. You pass in a vector of the data type and the algorithm sorts it.