h0hmj/insertion_sort.cpp

## insertion_sort.cpp
#include <utility>
#include <vector>
void insertion_sort(std::vector<int>& nums) {
    for (int i = 0; i < nums.size(); i++) {
        int j = i;
        while (j > 0 && nums[j] < nums[j - 1]) {
            std::swap(nums[j], nums[j - 1]);
            j--;
        }
    }
}
	#include <utility>
	#include <vector>
	void insertion_sort(std::vector<int>& nums) {
	for (int i = 0; i < nums.size(); i++) {
	int j = i;
	while (j > 0 && nums[j] < nums[j - 1]) {
	std::swap(nums[j], nums[j - 1]);
	j--;
	}
	}
	}