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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
