使用插入排序法排序1,2,3,4,5,6,7,8,9,0,并且显示代码过程
时间: 2023-08-05 16:07:30 浏览: 57
以下是使用插入排序法对1,2,3,4,5,6,7,8,9,0进行排序的代码过程:
```
int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0};
int n = sizeof(arr) / sizeof(arr[0]);
for(int i = 1; i < n; i++) {
int key = arr[i];
int j = i - 1;
while(j >= 0 && arr[j] > key) {
arr[j+1] = arr[j];
j--;
}
arr[j+1] = key;
}
for(int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
```
第一次循环:
- key = 2, j = 0,arr[0] = 1 < key,不进入while循环,arr[1] = key
- 此时数组为{1, 2, 3, 4, 5, 6, 7, 8, 9, 0}
第二次循环:
- key = 3, j = 1,arr[1] < key,不进入while循环,arr[2] = key
- 此时数组为{1, 2, 3, 4, 5, 6, 7, 8, 9, 0}
第三次循环:
- key = 4, j = 2,arr[2] < key,不进入while循环,arr[3] = key
- 此时数组为{1, 2, 3, 4, 5, 6, 7, 8, 9, 0}
第四次循环:
- key = 5, j = 3,arr[3] < key,不进入while循环,arr[4] = key
- 此时数组为{1, 2, 3, 4, 5, 6, 7, 8, 9, 0}
第五次循环:
- key = 6, j = 4,arr[4] < key,不进入while循环,arr[5] = key
- 此时数组为{1, 2, 3, 4, 5, 6, 7, 8, 9, 0}
第六次循环:
- key = 7, j = 5,arr[5] < key,不进入while循环,arr[6] = key
- 此时数组为{1, 2, 3, 4, 5, 6, 7, 8, 9, 0}
第七次循环:
- key = 8, j = 6,arr[6] < key,不进入while循环,arr[7] = key
- 此时数组为{1, 2, 3, 4, 5, 6, 7, 8, 9, 0}
第八次循环:
- key = 9, j = 7,arr[7] < key,不进入while循环,arr[8] = key
- 此时数组为{1, 2, 3, 4, 5, 6, 7, 8, 9, 0}
第九次循环:
- key = 0, j = 8,arr[8] > key,进入while循环,arr[9] = arr[8],j = 7,arr[8] = arr[j],j = 6,arr[7] = arr[j],j = 5,arr[6] = arr[j],j = 4,arr[5] = arr[j],j = 3,arr[4] = arr[j],j = 2,arr[3] = arr[j],j = 1,arr[2] = arr[j],j = 0,arr[1] = arr[j],j = -1,退出while循环,arr[0] = key
- 此时数组为{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
最终排序结果为:0 1 2 3 4 5 6 7 8 9
相关推荐
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)