modify

6799325f · 宋海霞 · f45de6e9 · 6799325f
--- a/main.c
+++ b/main.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[])
 		List.Elements[i] = InitList[i];
 	
 	//
-	// 堆排序
+	// Heap sort
 	//
 	HeapSort(&List);
 	
@@ -33,15 +33,15 @@ int main(int argc, char* argv[])

 /*
 function:
-	由下向上把各层子树调整成为大根堆.
+	Adjust the sub-trees of each layer from bottom to top to form a large root heap.

 parameter:
 	List -- Linear table pointer
 	size -- The number of elements in the linear table used to construct the large root heap
-	i -- 指定开始构造大根堆的元素的起始位置.从 0 开始计数.
+	i -- Specifies the starting position of the element that starts building the large root heap.Count from 0.
 	  
 returned value:
-	空
+	empty
 */
 void Sift(SortObject* List, int size, int i)
 {
@@ -55,13 +55,13 @@ void Sift(SortObject* List, int size, int i)

 /*
 function:
-	堆排序.
+	Heap sort.

 parameter:
 	List -- Linear table pointer
 	  
 returned value:
-	空
+	empty
 */
 void HeapSort(SortObject* List)
 {