14种排序

冒泡排序：

void bubble_sort(int arr[],int left, int right) {
for (int i = left; i < right; i++) {
for (int j = 0; j < right-i; j++) {
if (arr[j] > arr[j+1]) {
swap(arr[j], arr[j+1]);
}
}
}
}

选择排序

void select_sort(int arr[], int left, int right) {
for (int i = left; i < right; i++) {
for (int j = i; j <= right ; j++) {
if (arr[i] > arr[j])
swap(arr[i],arr[j]);
}
}
}