排序按原理分为插入排序,交换排序,选择排序,基数排序,归并排序五大类,按计算时间复杂度分为简单排序O(n*n)和快速排序O(nlogn),归并排序明确做了,直接排序按直接插入排序做了,快速不明确,没有做.
归并排序 [54,49],[65,97],[76,50],[51,049]
1趟 [49,54],[65,97],[50,76],[049,51]
2趟 [49,54,65,97],[049,50,51,76]
3趟 [49,049,50,51,54,65,76,97]
直接插入排序 54,49,65,97,76,50,51,049
1趟 49,54,65,97,76,50,51,049
2趟 49,54,65,97,76,50,51,049
3趟 49,54,65,97,76,50,51,049
4趟 49,54,65,76,97,50,51,049
5趟 49,50,54,65,76,97,51,049
6趟 49,50,51,54,65,76,97,049
7趟 49,049,50,51,54,65,76,97