#pragma once
#include <span>

template <typename T>
void insertSort(std::span<T> container) {
	auto len = container.size();
	for (auto i = 1u; i < len; i++) {
		T insertValue = container[i];
		auto j = i;
		while (j > 0 && insertValue < container[j-1]) {
			j--;
			container[j + 1] = container[j];
		}

		container[j] = insertValue;
	}
}