Advertisement
Guest User

Untitled

a guest
Mar 27th, 2017
35
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.61 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. void heapify(int *array, int arraySize){
  5. int i,aux;
  6.  
  7. for(i=1;i<arraySize;i++){
  8. if(*(array+i)>*(array+(i/2))){
  9. aux=*(array+i);
  10. *(array+i)=*(array+(i/2));
  11. *(array+(i/2))=aux;
  12. i=0;
  13. }
  14. }
  15. }
  16.  
  17. void heapSort(int *array, int arraySize){
  18.  
  19. int aux;
  20.  
  21. while(arraySize>0){
  22.  
  23. heapify(array, arraySize);
  24.  
  25. aux=*(array);
  26. *(array)=*(array+arraySize-1);
  27. *(array+arraySize-1)=aux;
  28. arraySize--;
  29. }
  30.  
  31. }
  32.  
  33. int main() {
  34.  
  35. int a[]={6,5,3,1,8,7,2,4},n=8,i;
  36.  
  37. heapSort(a,8);
  38.  
  39. for(i=0;i<n;i++)
  40. printf("%d ", a[i]);
  41.  
  42. return 0;
  43. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement