插入排序

1. #include<iostream>
2. #include<string>
3. void insertSort(int *arr,unsigned int Length);
4. void insertSortMy(int *arr,unsigned int Length);
5. void insertSort(int *arr,unsigned int Length){
6. for(int iter=1; iter<Length; iter++){
7. int temp=arr[iter];
8. int i=iter-1;
9. while(i>=0&&arr[i]>temp){
10. arr[i+1]=arr[i];
11. --i;
12. }
13. arr[i+1]=temp;
14. }
15. }
16. void insertSortMy(int *arr,unsigned int Length){
17. for(int iter=1; iter<Length;iter++){
18. int temp=arr[iter];
19. int i;
20. for(i=iter-1; i>=0;--i){
21. if(arr[i]>temp){
22. arr[i+1]=arr[i];
23. }else{
24. break;
25. }
26. }
27. arr[i+1]=temp;
28. }
29. }

来自为知笔记(Wiz)

转载于:https://www.cnblogs.com/yml435/p/4655554.html