#include <iostream>
using namespace std;
void insertsort(int arr[], int n);
void swap(int arr[], int i, int j);
void print(int arr[], int n);
void insertsort(int arr[], int n) {
int end = 1;
for (end; end < n; end++) {
int newindex = end;
while (newindex - 1 >= 0 && arr[newindex] < arr[newindex - 1]) {
swap(arr, newindex, newindex - 1);
newindex--;
}
}
}
void insertsort2(int arr[], int n) {
int end = 1;
for (end; end < n; end++) {
for (int pre = end - 1; pre >= 0 && arr[pre] > arr[pre + 1]; pre--) {
swap(arr, pre, pre+1);
}
}
}
void swap(int arr[], int i, int j) {
int tmp = 0;
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
void print(int arr[], int n) {
int i = 0;
for (i = 0; i < n; i++) {
cout << arr[i] << endl;
}
}
int main() {
int arr[9] = { 2,4,5,6,8,9,4,2,5 };
insertsort2(arr, 9);
print(arr, 9);
system("pause");
return 0;
}
排序算发——插入排序
最新推荐文章于 2024-10-27 18:45:12 发布