VB icon

Array Heap Sort

Submitted on: 1/7/2015 2:58:00 PM
By: Debjit Kar (from psc cd)  
Level: Beginner
User Rating: By 4 Users
Compatibility: C, C++ (general)
Views: 5645
     Sorting an array using heap sort
Can't Copy and Paste this?
Click here for a copy-and-paste friendly version of this code!
// Name: Array Heap Sort
// Description:Sorting an array using heap sort
// By: Debjit Kar (from psc cd)

#include <stdio.h>
void fnSortHeap(int[], int);
void main()
	int i, arr_num_items;
	int arr[] = {7,10,25,17,23,27,16,19,37,42,4,33,1,5,11};
	//total number of items in array.
	//if you do not provide the exact number you might get unwanted results
	arr_num_items = 15;
	//call fnSortHeap function for (arr_num_items - 2) times.
	for(i=arr_num_items; i>1; i--)
		fnSortHeap(arr, i - 1);
	//print the sorted array
	printf("\nThe Sorted Array\n----------------\n");
	for (i = 0; i < arr_num_items; i++)
//sort heap
void fnSortHeap(int arr[], int arr_ubound)
int i,o;
int lChild, rChild, mChild, root, temp;
//find the root element of the current element
root = (arr_ubound-1)/2;
//creating the heap
lChild = (2*i)+1;
rChild = (2*i)+2;
	if ((lChild <= arr_ubound) && (rChild <= arr_ubound))
 if(arr[rChild] >= arr[lChild])
mChild = rChild;
mChild = lChild;
 if(rChild > arr_ubound)
mChild = lChild;
mChild = rChild;
//swap elements
if (arr[i] < arr[mChild])
 temp = arr[i];
 arr[i] = arr[mChild];
 arr[mChild] = temp;
//move the max element to the end of the array
temp = arr[0];
arr[0] = arr[arr_ubound];
arr[arr_ubound] = temp;

Report Bad Submission
Use this form to tell us if this entry should be deleted (i.e contains no code, is a virus, etc.).
This submission should be removed because:

Your Vote

What do you think of this code (in the Beginner category)?
(The code with your highest vote will win this month's coding contest!)
Excellent  Good  Average  Below Average  Poor (See voting log ...)

Other User Comments

 There are no comments on this submission.

Add Your Feedback
Your feedback will be posted below and an email sent to the author. Please remember that the author was kind enough to share this with you, so any criticisms must be stated politely, or they will be deleted. (For feedback not related to this particular code, please click here instead.)

To post feedback, first please login.