堆排序（C语言） 

  1. #ifndef HEAP_SORT_H
  2. #define HEAP_SROT_H
  3. #include<iostream>
  4. void maxHeap(int *arr,unsigned int Length); 
  5. void maxHeap(int *arr,unsigned int rootIndex,unsigned int heapSize);
  6. void builMaxHeap( int *arr,unsigned int heapSize); 
  7. inline unsigned int right(unsigned int index); 
  8. inline unsigned int left(unsigned int index); 
  9. void heapSort(int *arr,int Length); 
  10. inline unsigned int left(unsigned int index){
  11. 	return 2*index+1; 
  12. }
  13. inline unsigned int right(unsigned int index){
  14. 	return 2*index+2; 
  15. }
  16. void maxHeap(int *arr,unsigned int rootIndex,unsigned int heapSize){
  17. 	unsigned int leftIndex=left(rootIndex); 
  18. 	unsigned int rightIndex=right(rootIndex); 
  19. 	unsigned int largest; 
  20. 	if(arr[leftIndex]>arr[rootIndex]&&leftIndex<heapSize){
  21. 		largest=leftIndex;
  22. 	}else{
  23. 		largest=rootIndex;
  24. 	}
  25. 	if(arr[rightIndex]>arr[largest]&&rightIndex<heapSize){
  26. 		largest=rightIndex; 	
  27. 	}
  28. 	if(largest!=rootIndex){
  29. 		int temp=arr[largest]; 
  30. 		arr[largest]=arr[rootIndex]; 
  31. 		arr[rootIndex]=temp; 
  32. 		maxHeap(arr,largest,heapSize); 
  33. 	}
  34. }
  35. void builMaxHeap( int *arr,unsigned int heapSize){
  36. 	for(int i=heapSize/2-1; i>=0;--i){
  37. 		maxHeap(arr,i,heapSize); 
  38. 	}
  39. }
  40. void heapSort(int *arr,int Length){
  41. 	for(int size=Length-1;size>0;size--){
  42. 		builMaxHeap(arr,size); 
  43. 		int temp=arr[size]; 
  44. 		arr[size]=arr[0]; 
  45. 		arr[0]=temp; 
  46. 	}
  47. }
  48. #endif







posted @ 2015-07-17 19:54  yml435  阅读(167)  评论(0)  编辑  收藏  举报