modify

ee46c7fc · 宋海霞 · 57fa9c72 · ee46c7fc · ee46c7fc
--- a/SortObject.h
+++ b/SortObject.h
 #ifndef SORTOBJECT_H_
 #define SORTOBJECT_H_

-
 //
 // Include the C standard library header file here
 //

 #include <stdio.h>

-
 //
 // Other header files are included here
 //

-
-
 //
 // Define the data structure here
 //

-typedef struct _SortObject{
-	int length;					// The actual length of the linear table, the number of elements in the linear table.
-	int* Elements;				// Arrays are used to store elements in linear tables.
+typedef struct _SortObject
+{
+	int length;		// The actual length of the linear table, the number of elements in the linear table.
+	int* Elements;	// Arrays are used to store elements in linear tables.
 }SortObject;

 //
@@ -31,10 +28,8 @@ typedef struct _SortObject{
 void Sift(SortObject* List, int size, int p);
 void HeapSort(SortObject* List);

-
 //
 // Declare global variables here
 //

-
 #endif /* SORTOBJECT_H_ */
--- a/main.c
+++ b/main.c
 #include "SortObject.h"

-
 int main(int argc, char* argv[])
 {	
 	int i;
@@ -13,15 +12,17 @@ int main(int argc, char* argv[])
 	int n = sizeof(InitList) / sizeof(InitList[0]);	// Calculate the linear table length
 	List.Elements = (int*)malloc(sizeof(int) * n);
 	List.length = n;
-	for(i=0; i < List.length; i++)
+	for (i=0; i < List.length; i++)
+	{
 		List.Elements[i] = InitList[i];
+	}
 	
 	//
 	// Heap sort
 	//
 	HeapSort(&List);
 	
-	for(i=0; i < List.length; i++)
+	for (i=0; i < List.length; i++)
 	{
 		printf("%d ", List.Elements[i]);
 	}
@@ -38,7 +39,8 @@ function:
 parameter:
 	List -- Linear table pointer
 	size -- The number of elements in the linear table used to construct the large root heap
-	i -- Specifies the starting position of the element that starts building the large root heap.Count from 0.
+	i -- Specifies the starting position of the element 
+		 that starts building the large root heap.Count from 0.
 	  
 returned value:
 	empty
@@ -67,7 +69,8 @@ void HeapSort(SortObject* List)
 {
 	int i = 0;               // The cursor
 	int size = List->length; // The number of elements in a linear table
-	int HeapSize = 0;        // The number of elements in the linear table used to construct the large root heap
+	 // The number of elements in the linear table used to construct the large root heap
+	int HeapSize = 0;       
 	
 	//
 	// TODO: Add the code here