#include<iostream>
using namespace std;
void QuickSort(int arr[], int begin, int end)//快速排序
{
int temp = arr[begin];
int i = begin, j = end;
while (i < j)
{
while (i < j && arr[j] >= temp) j--;
if (i < j) arr[i++] = arr[j];
while (i < j && arr[i] <= temp) i++;
if (i < j) arr[j--] = arr[i];
}
arr[i] = temp;
for (int a = 0; a < 10; a++)
{
cout << arr[a] << " ";
}
cout << endl;
if (begin < i - 1) QuickSort(arr, begin, i - 1);
if (i + 1 < end) QuickSort(arr, i + 1, end);
}
void ShellSort(int arr[], int n)//希尔排序
{
int i, j, d = n / 2;
int e;
while (d > 0)
{
for (i = d; i < n; i++)
{
e = arr[i];
j = i - d;
while (j >= 0 && e < arr[j])
{
arr[j + d] = arr[j];
j -= d;
}
arr[j + d] = e;
}
d = d / 2;
for (int a = 0; a < 10; a++)
{
cout << arr[a] << " ";
}
cout << endl;
}
}
void Merge(int arr[], int low, int mid, int hight)
{
int* temp = new int[hight + 1];
int i = low, j = mid + 1,k = low;
while (i <= mid && j <= hight)
{
if (arr[i] <= arr[j])
{
temp[k++] = arr[i++];
}
else
{
temp[k++] = arr[j++];
}
}
while (i <= mid)
temp[k++] = arr[i++];
while (j <= hight)
temp[k++] = arr[j++];
for (i = low; i <= hight; i++)
{
arr[i] = temp[i];
}
delete temp;
}
void MergeSort(int arr[], int n)//二路归并排序
{
int len = 1, i;
while (len < n)
{
i = 0;
while (i + 2 * len <= n)
{
Merge(arr, i, i + len - 1, i + 2 * len - 1);
i += 2 * len;
}
if (i + len < n)
{
Merge(arr, i, i + len - 1, n - 1);
}
for (int a = 0; a < 10; a++)
{
cout << arr[a] << " ";
}
cout << endl;
len *= 2;
}
}
void FilterDown(int arr[], int low, int high)
{
int f = low, i = 2 * low + 1;
int e = arr[low];
while (i <= high)
{
if (i < high && arr[i] < arr[i + 1])
{
i++;
}
if (e < arr[i])
{
arr[f] = arr[i];
f = i;
i = 2 * f + 1;
}
else
break;
}
arr[f] = e;
}
void HeapSort(int arr[], int n)
{
int i;
for (i = (n - 2) / 2; i >= 0; --i)
{
FilterDown(arr, i, n - 1);
}
for (i = n - 1; i > 0; --i)
{
swap(arr[0], arr[i]);
FilterDown(arr, 0, i - 1);
for (int a = 0; a < 10; a++)
{
cout << arr[a] << " ";
}
cout << endl;
}
}
int main()
{
int arr[10] = {7,6,85,41,4,98,84,8,70,2};
/*for (int i = 0; i < 10; i++)
{
int temp = 0;
cin >> temp;
arr[i] = temp;
}*/
cout << "快速排序:" << endl;
QuickSort(arr, 0, 9);
int arr1[10] = { 7,6,85,41,4,98,84,8,70,2 };
cout << "希尔排序:" << endl;
ShellSort(arr1, 10);
int arr2[10] = { 7,6,85,41,4,98,84,8,70,2 };
cout << "二路归并排序:" << endl;
MergeSort(arr2, 10);
int arr3[10] = { 7,6,85,41,4,98,84,8,70,2 };
cout << "堆排序:" << endl;
HeapSort(arr3, 10);
return 0;
}
数据结构排序
最新推荐文章于 2024-09-15 08:16:50 发布