基于队与栈结合排序算法实现及性能分析  

A Sorting Algorithm Design and Performance Analysis Basedon Team with Stack

作　　者：钱明珠[1] 汪小宝[1] 

机构地区：[1]鄂东职业技术学院,湖北黄冈438000

出　　处：《电脑与信息技术》2013年第6期52-53,共2页Computer and Information Technology

摘　　要：排序有许多经典的算法,如插入排序、交换排序、选择排序等。这些排序算法的性能包括时间复杂度、空间复杂度以及稳定性各有优劣。笔者在这里给出一种全新的排序算法——队与栈排序。这种算法打破传统以交换或移动为主要排序的做法,而是借助栈和队这两种数据结构来实现排序。Sorting has many classical algorithm, such as insertion sort, exchange sort, selection sort etc.The performance of these sorting algorithms including the time complexity, space complexity and stability have their pros and cons. Here the author gives a new algorithm-＇-team and stack sort. This algorithm breaks the traditional exchange or move as the main sorting approach, but with the help of stack and the two data structure to achieve the sort.

关 键 词：栈 队列 排序 时间复杂度 空间复杂度 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]