ComputingComputer ScienceAlgorithmsData StructuresSequence AnalysisData Structure AlgorithmsSearching AlgorithmsSorting AlgorithmsSorting ProblemsBubble SortComplexity Of SortingExperimental Study DesignInsertion SortLogarithmic Space ComplexityMerge SortSelection SortSorting
Sorting algorithm is one of the most basic research fields in computer science. It's goal is to make record easier to search, insert and delete. Through the description of five sort algorithms: bubble, select, insert, merger and quick, the time and space complexity was summarized. Furthermore, two categories of O(n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) and O(nlog n) could be found out. From the aspects of input sequence scale and input sequence random degree, some results were obtained based on the experiments. When the size of records is small, insertion sort or selection sort performs well. When the sequence is ordered, insertion sort or bubble sort performs well. When the size of records is large, quick sort or merge sort performs well. Different application could select appropriate sort algorithm according to these rules.
5
An efficient variation of bubble sort
Włodzimierz Dobosiewicz · Information Processing Letters · 1980 · 27 citations
Efficient unbalanced merge–sort
Enrico Nardelli, Guido Proietti · Information Sciences · 2005 · 10 citations
Analysis of the Complexity of Quick Sort for Two Dimension Table
Hu Feng · 2007 · 10 citations