Quick Sorting Algorithm of Matrix

摘要：

On the basis of the quick sorting algorithm of one-dimensional array, the quick sorting algorithm of Matrix was provided. It is not recursion. Theoretical analysis and the results from a large number of experiments dealing with data showed that the average calculation time of the algorithm was O(nlog2n ), and generally the required stack space was also O(log2n ),which was an effective and reliable quick sorting algorithm.

关键词： Matrix one-dimensional array quick sorting algorithm

作者: Peng Yueying Li Shicai Li Miao

作者单位: Department of Information Technology,Guangxi Teachers Education University,Nanning 530023,China Guangxi Nanning design institute of water resources and electric power,Guangxi Nanning 530001,China

会议类型: 国际会议

会议名称: 第八届国际电子测量与仪器学术会议(Proceedings of 2007 8th International Conference on Electronic Measurement & Instruments)

会议地点: 西安

会议语种:英文

在线出版日期: 2007-08-16（万方平台首次上网日期，不代表论文的发表时间）