32 lines
799 B
C++
32 lines
799 B
C++
|
/**
|
||
|
|
* File: insertion_sort.cpp
|
||
|
|
* Created Time: 2022-11-25
|
||
|
|
* Author: krahets (krahets@163.com)
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "../utils/common.hpp"
|
||
|
|
|
||
|
|
/* 插入排序 */
|
||
|
|
void insertionSort(vector<int> &nums) {
|
||
|
|
// 外循环：已排序元素数量为 1, 2, ..., n
|
||
|
|
for (int i = 1; i < nums.size(); i++) {
|
||
|
|
int base = nums[i], j = i - 1;
|
||
|
|
// 内循环：将 base 插入到已排序部分的正确位置
|
||
|
|
while (j >= 0 && nums[j] > base) {
|
||
|
|
nums[j + 1] = nums[j]; // 将 nums[j] 向右移动一位
|
||
|
|
j--;
|
||
|
|
}
|
||
|
|
nums[j + 1] = base; // 将 base 赋值到正确位置
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Driver Code */
|
||
|
|
int main() {
|
||
|
|
vector<int> nums = {4, 1, 3, 1, 5, 2};
|
||
|
|
insertionSort(nums);
|
||
|
|
cout << "插入排序完成后 nums = ";
|
||
|
|
printVector(nums);
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|