我们以TZC 1283为例简单说明一下排序(含十大经典排序算法)的python实现方法和C实现方法。堆排序原理请参见:https://blog.csdn.net/u010452388/article/details/81283998 或 https://www.runoob.com/w3cnote/heap-sort.html
- 大顶堆:每个节点的值都大于或等于其子节点的值,在堆排序算法中用于升序排列;
- 小顶堆:每个节点的值都小于或等于其子节点的值,在堆排序算法中用于降序排列;
原题链接:1283: 简单排序
python代码如下:
import math
# 堆排序
def build_maxheap(arr):
for i in range(math.floor(len(arr) / 2), -1, -1):
heapify(arr, i)
def heapify(arr, i):
left = 2 * i + 1
right = 2 * i + 2
largest = i
if left < arrLen and arr[left] > arr[largest]:
largest = left
if right < arrLen and arr[right] > arr[largest]:
largest = right
if largest != i:
swap(arr, i, largest)
heapify(arr, largest)
def swap(arr, i, j):
arr[i], arr[j] = arr[j], arr[i]
def heap_sort(arr):
global arrLen
arrLen = len(arr)
build_maxheap(arr)
for i in range(len(arr) - 1, 0, -1):
swap(arr, 0, i)
arrLen -= 1
heapify(arr, 0)
return arr
T = int(input())
for i in range(T):
s = input().split()
lt = [int(x) for x in s]
lt1 = lt[::-1]
lt1.pop()
lt1 = lt1[::-1]
n = len(lt1)
heap_sort(lt1)
for j in range(n):
if j != n - 1:
print(lt1[j], end=' ')
else:
print(lt1[j])
C语言代码如下:
#include <stdio.h>
#include <string.h>
#define N 1010
int a[N];
void Swap(int *a, int *b)
{
int tmp;
tmp=*a;
*a=*b;
*b=tmp;
}
//建大堆
void AdjustDown(int arr[], int size, int root)
{
int left=2*root+1;
int right=2*root+2;
int max;
//没有左孩子
if(left>=size)
return;
//右孩子存在且大于左孩子
if(right<size && arr[right]>arr[left])
max=right;
else
max=left;
if(arr[root]>=arr[max])
return;
Swap(arr+root,arr+max);
AdjustDown(arr,size,max);
}
void CreateHeap(int arr[], int size)
{
int i;
for(i=(size-1-1)/2; i>=0; i--)
AdjustDown(arr, size, i);
}
void HeapSort(int arr[], int size)
{
int i;
CreateHeap(arr, size);
for(i=0; i<size; i++)
{
Swap(arr, arr+size-i-1);
AdjustDown(arr, size-i-1, 0);
}
}
int main()
{
int m,n,i,j,t;
scanf("%d",&m);
while(m--)
{
scanf("%d",&n);
memset(a,0,n); //初始化数组
for(i=0;i<=n-1;i++) //输入
scanf("%d",&a[i]);
HeapSort(a,n);
for(i=0;i<=n-1;i++) //输出
{
if(i!=n-1)
printf("%d ",a[i]);
else
printf("%d\n",a[i]);
}
}
return 0;
}