void insertionSort(vec <int> &arr, int start) {
	for (int i = start; i < arr.gsize(); i++) {
		if (arr[i] < arr[i - 1]) {
			int k = i;
			while (arr[k] < arr[k - 1] && k != 0) {
				swap(arr[k], arr[k - 1]);
				k--;
			}
		}
	}
}