多线程快速排序算法的设计与优化  

Implementation and optimization of multi-thread quicksort algorithm

作　　者：李添锐 曹庆年[1] 孟开元[1] Li Tianrui;Cao Qingnian;Meng Kaiyuan(College of Computing,Xi’an Shiyou University,Xi’an 710065,China)

机构地区：[1]西安石油大学计算机学院,陕西西安710065

出　　处：《无线互联科技》2022年第7期134-136,共3页Wireless Internet Technology

摘　　要：文章根据传统快速排序算法的特点,在传统快速排序方式的基础上,提出了采用多线程方法进一步优化的算法。首先,通过C++多线程编程开发优化算法;其次,在算法性能对比中达到优化算法的性能提升效果;最后,对优化算法进行理论分析,得出了在最优情况下该算法的性能提升上限,并对此进行了验证。According to the characteristics of the traditional quicksort algorithm,this paper presents an algorithm for further optimization based on the traditional optimization method.Firstly,the optimization algorithm is realized through C++multi-threaded programming development.Secondly,in the comparison,it is concluded that the optimal algorithm is several times better than the traditional algorithm.Finally,the optimization algorithm is analyzed theoretically.The upper limit of performance improvement is obtained under the optimal condition and it has been verified.

关 键 词：多线程 快速排序 算法优化 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]