## 内部排序算法的时间复杂度分析

Time Complexity Analysis of The Internal Sorting Algorithm
Abstract:  Sorting algorithm is the basis of computer program design, database, operating system, compiler theory and artificial intelligence etc，which are widely used in various fields of information science, system engineering. In the computer system, internal sorting algorithm is sorted in memory. The algorithm will directly affect the performance of software system. Evaluation algorithms mainly two aspects: algorithm occupied space (memory) and time required to run this algorithm. This paper mainly introduces several internal sorting algorithm and its time complexity analysis of the theory and experiments.
Key words:  The sort; The algorithm; The time complexity

1. 内部排序算法    2
2. 时间复杂度    2
2.1 算法的时间消耗    3
2.2 平均时间复杂度    4
2.3 最坏时间复杂度    4
2.4 最好时间复杂度    4
2.5 渐进时间复杂度    5
3. 内部排序算法的时间复杂度    5
3.1 插入类排序算法的时间复杂度    5
3.2 交换类排序算法的时间复杂度    8

3.3 选择类排序算法的时间复杂度    11
3.4 归并排序算法的时间复杂度    15
3.5 基数排序算法的时间复杂度    16
4. 排序算法时间复杂度实验分析    16
4.1 内部排序的时间复杂度对比    16
4.2 实验分析    17

------分隔线----------------------------