143 lines
3.0 KiB
C++
143 lines
3.0 KiB
C++
#include<iostream>
|
||
#include<stdlib.h>
|
||
#include<math.h>
|
||
using namespace std;
|
||
int threshold;
|
||
|
||
/* 请在这里补充你的代码，即你所实现的sort函数 */
|
||
|
||
#define swap(type, a, b) do {type tmp = a; a = b; b = tmp;} while(0)
|
||
|
||
void partition(int* arr, int l, int r, int& oi, int& ok) {
|
||
int mid = (l + r) / 2;
|
||
swap(int, arr[mid], arr[l + 1]);
|
||
if (arr[l + 1] > arr[r]) swap(int, arr[l + 1], arr[r]);
|
||
if (arr[l] > arr[r]) swap(int, arr[l], arr[r]);
|
||
if (arr[l + 1] > arr[l]) swap(int, arr[l + 1], arr[l]);
|
||
|
||
int pivot = arr[l];
|
||
|
||
int i = l, j = l, k = r;
|
||
while (j <= k) {
|
||
if (arr[j] < pivot) {
|
||
swap(int, arr[j], arr[i]);
|
||
i++;
|
||
j++;
|
||
} else if (arr[j] > pivot) {
|
||
swap(int, arr[j], arr[k]);
|
||
k--;
|
||
} else {
|
||
j++;
|
||
}
|
||
}
|
||
oi = i;
|
||
ok = k;
|
||
}
|
||
|
||
void sift_down(int* arr, int l, int len, int root) {
|
||
while (root * 2 <= len) {
|
||
int child = root * 2;
|
||
if (child + 1 <= len && arr[l + child] > arr[l + child - 1]) {
|
||
child++;
|
||
}
|
||
if (arr[l + child - 1] > arr[l + root - 1]) {
|
||
swap(int, arr[l + root - 1], arr[l + child - 1]);
|
||
root = child;
|
||
} else {
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
|
||
void heap_sort(int* arr, int l, int r) {
|
||
int len = r - l + 1;
|
||
for (int i = len / 2; i >= 1; i--) {
|
||
sift_down(arr, l, len, i);
|
||
}
|
||
|
||
printf("Heap:");
|
||
for (int i = 0; i < len; i++) {
|
||
printf("%d ", arr[l + i]);
|
||
}
|
||
printf("\n");
|
||
|
||
for (int i = len; i > 1; i--) {
|
||
swap(int, arr[l], arr[l + i - 1]);
|
||
sift_down(arr, l, i - 1, 1);
|
||
}
|
||
}
|
||
|
||
|
||
|
||
void intro_sort(int* arr, int l, int r, int limit) {
|
||
while (r - l + 1 > threshold) {
|
||
|
||
if (limit == 0) {
|
||
heap_sort(arr, l, r);
|
||
return;
|
||
}
|
||
limit--;
|
||
|
||
int i, k;
|
||
partition(arr, l, r, i, k);
|
||
|
||
int left = i - l;
|
||
int right = r - k;
|
||
|
||
if (left < right) {
|
||
intro_sort(arr, l, i - 1, limit);
|
||
l = k + 1;
|
||
} else {
|
||
intro_sort(arr, k + 1, r, limit);
|
||
r = i - 1;
|
||
}
|
||
}
|
||
}
|
||
|
||
void insertion_sort(int* arr, int n) {
|
||
for (int i = 2; i <= n; i++) {
|
||
int key = arr[i];
|
||
int j = i - 1;
|
||
while (j >= 1 && arr[j] > key) {
|
||
arr[j + 1] = arr[j];
|
||
j--;
|
||
}
|
||
arr[j + 1] = key;
|
||
}
|
||
}
|
||
|
||
void sort(int *R, int n) {
|
||
int depth_limit = floor(2 * log2(n));
|
||
printf("depth_limit:%d\n", depth_limit);
|
||
|
||
intro_sort(R, 1, n, depth_limit);
|
||
|
||
printf("Intermediate:");
|
||
for (int i = 1; i <= n; i++) {
|
||
printf("%d ", R[i]);
|
||
}
|
||
printf("\n");
|
||
|
||
insertion_sort(R, n);
|
||
}
|
||
|
||
|
||
|
||
int main()
|
||
{
|
||
int n,i;
|
||
int a[50010];
|
||
scanf("%d %d", &n, &threshold);
|
||
for (i = 1; i <= n; i++)
|
||
scanf("%d", &a[i]);
|
||
|
||
sort(a,n);
|
||
|
||
printf("Final:");
|
||
for (i = 1; i <= n; i++)
|
||
printf("%d ",a[i]);
|
||
printf("\n");
|
||
return 0;
|
||
}
|
||
|