[C++] 삽입정렬 코드 구현

#include<iostream>
#include<algorithm>
using namespace std;

int *insertion_sort(int data[], int size) {

	for (int i = 1; i < size; i++) {
		for (int j = i; j >= 1; j--) {
			if (data[j - 1] > data[j])
				swap(data[j - 1], data[j]);
			else
				break;
		}
	}

	return data;
}

int main() {
	int arr[10] = {5, 2, 7, 10, 9, 1, 3, 6, 8, 4 };
	int *result;
	result = insertion_sort(arr, sizeof(arr)/sizeof(int));
	
	for (int i = 0; i < 10; i++)
		cout << result[i] << " ";

}