DocumentCode :
1725551
Title :
Quick Sorting Algorithm of Matrix
Author :
Yueying, Peng ; Shicai, Li ; Miao, Li
Author_Institution :
Guangxi Teachers Educ. Univ., Nanning
fYear :
2007
Abstract :
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.
Keywords :
matrix algebra; sorting; 1D array; matrix algorithm; quick sorting algorithm; Algorithm design and analysis; Design engineering; Engineering management; Hydrology; Information technology; Instruments; Petroleum; Sorting; Tail; Water resources; Matrix; algorithm; one-dimensional array; quick sorting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electronic Measurement and Instruments, 2007. ICEMI '07. 8th International Conference on
Conference_Location :
Xi´an
Print_ISBN :
978-1-4244-1136-8
Electronic_ISBN :
978-1-4244-1136-8
Type :
conf
DOI :
10.1109/ICEMI.2007.4350753
Filename :
4350753
Link To Document :
بازگشت