期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2013
卷号：13
期号：9
页码：51-57
出版社：International Journal of Computer Science and Network Security
摘要：A lot of sorting algorithms exist today which are based on different problem solving techniques and with different performance behaviors. Algorithms are judged by the running time and space complexity which they take to solve any specific problem. In this papers an efficient sorting algorithm has been introduced, this algorithm is based on dynamic programming technique which is used to solve the optimization problems and here to sort arrays with optimal merges. Algorithm uses a bottom-up approach to compute the pre-sorted sub-sequences of random lengths in a given array of numbers and then sorts the whole array after efficiently combining the identified sub-sequences by using dynamic programming technique. Overlapping sub-problems are identified while sorting the given array and dynamic programming keeps the track of all the overlapping sub-problems by memorizing the data in a tabular form which is the main theme of the mentioned technique. Running time of the algorithm is compared with the standard merge sort and the results are satisfying.
