Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- void heapify(int *array, int arraySize){
- int i,aux;
- for(i=1;i<arraySize;i++){
- if(*(array+i)>*(array+(i/2))){
- aux=*(array+i);
- *(array+i)=*(array+(i/2));
- *(array+(i/2))=aux;
- i=0;
- }
- }
- }
- void heapSort(int *array, int arraySize){
- int aux;
- while(arraySize>0){
- heapify(array, arraySize);
- aux=*(array);
- *(array)=*(array+arraySize-1);
- *(array+arraySize-1)=aux;
- arraySize--;
- }
- }
- int main() {
- int a[]={6,5,3,1,8,7,2,4},n=8,i;
- heapSort(a,8);
- for(i=0;i<n;i++)
- printf("%d ", a[i]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement