折半插入排序代码c++
时间: 2023-12-10 11:34:55 浏览: 40
以下是C++实现折半插入排序的代码:
```c++
void binaryInsertSort(int arr[], int len) {
int front, end, temp;
for (int i = 1; i < len; i++) {
temp = arr[i];
front = 0;
end = i - 1;
while (front <= end) {
int mid;
mid = (front + end) / 2;
if (temp < arr[mid]) {
end = mid - 1;
} else {
front = mid + 1;
}
}
for (int z = i; z > front; z--) {
arr[z] = arr[z - 1];
}
arr[front] = temp;
}
}
```
相关问题
数据结构折半插入排序c++
以下是C++实现的折半插入排序代码:
```c++
void binaryInsertSort(int arr[], int len) {
for (int i = 1; i < len; i++) {
int temp = arr[i];
int left = 0, right = i - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (arr[mid] > temp) {
right = mid - 1;
} else {
left = mid + 1;
}
}
for (int j = i - 1; j >= left; j--) {
arr[j + 1] = arr[j];
}
arr[left] = temp;
}
}
```
折半插入排序的基本思想是:将一个元素插入到已经排好序的数组中,仍然保持有序。与直接插入排序不同的是,折半插入排序使用二分查找来寻找插入位置,从而减少了比较次数,提高了排序效率。
直接插入排序、希尔排序、折半插入排序的c++代码
下面是直接插入排序、希尔排序、折半插入排序的C++代码:
直接插入排序:
```c++
void insertionSort(int arr[], int n) {
for (int i = 1; i < n; i++) {
int key = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = key;
}
}
```
希尔排序:
```c++
void shellSort(int arr[], int n) {
int gap = 1;
while (gap < n / 3) {
gap = gap * 3 + 1;
}
while (gap > 0) {
for (int i = gap; i < n; i++) {
int key = arr[i];
int j = i - gap;
while (j >= 0 && arr[j] > key) {
arr[j + gap] = arr[j];
j -= gap;
}
arr[j + gap] = key;
}
gap = (gap - 1) / 3;
}
}
```
折半插入排序:
```c++
void binaryInsertionSort(int arr[], int n) {
for (int i = 1; i < n; i++) {
int key = arr[i];
int left = 0, right = i - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (arr[mid] > key) {
right = mid - 1;
} else {
left = mid + 1;
}
}
for (int j = i - 1; j >= left; j--) {
arr[j + 1] = arr[j];
}
arr[left] = key;
}
}
```
以上是三种排序算法的C++代码,可以根据需要进行调用。