查找最小的 K 个元素

题目:

输入 n 个整数, 输出其中最小的 K 个.

 

思路:

建立一个大小为 k 的大顶堆,  如果新的数小于堆顶数, 则替换它, 然后重新调整堆.

最后输出 K 个数时, 按堆排序的思想全部有序排列, 输出 K 个数.

 

实现代码:

#include <stdio.h> #include <stdlib.h> void AdjustHeap(int *heap, int k, int pos); void DoHeap(int *heap, int k, int item); void SortHeap(int *heap, int k); int main() { int n; // total number int k; // the k min-value int *heap = NULL; // point to the heap int item; int i; // input n, k printf("Input the n: "); scanf("%d", &n); printf("Input the k: "); scanf("%d", &k); // allocate memory for the heap heap = (int *)malloc((k+1) * sizeof(int)); // heap[0] has no item, make heap sort convience if(NULL == heap) { printf("malloc failed./n"); exit(1); } // handle every input item printf("Input the %d items: ", n); for(i=0; i<n; i++) { scanf("%d", &item); DoHeap(heap, k, item); } // sort the heap completely SortHeap(heap, k); // output the k min-value printf("The %d min values are: ", k); for(i=1; i<=k; i++) printf("%d ",heap[i]); printf("/n"); free(heap); return 0; }/* main() */ void DoHeap(int *heap, int k, int item) { static int count = 1; int i; if(count < k) { heap[count] = item; count ++; } else if(count == k) { heap[count] = item; count ++; // adjust the whole heap for(i=k/2; i>0; i--) AdjustHeap(heap, k, i); } else if(count == (k+1)) { // if the new item is min than heap-top item, exchange them, and then // adjust the heap if(item < heap[1]) { heap[1] = item; AdjustHeap(heap, k, 1); } } }/* DoHeap() */ // implemnt the heap-sort algorithm void AdjustHeap(int *heap, int k, int pos) { int item; int i; int track; item = heap[pos]; track = pos; for(i=pos*2; i<=k; i=i*2) { if((i<k)&&(heap[i] < heap[i+1])) // "i<k" is needed when i==k is true i++; if(item >= heap[i]) break; heap[track] = heap[i]; track = i; } heap[track] = item; }/* AdjustHeap() */ void SortHeap(int *heap, int k) { int i; int temp; for(i=k; i>1; i--) { temp = heap[i]; heap[i] = heap[1]; heap[1] = temp; AdjustHeap(heap, i-1, 1); } }/* SortHeap() */