modify

d30e9a30 · 宋海霞 · 50f00286 · d30e9a30
--- a/main.c
+++ b/main.c
 #include "QuickSort.h"

-Stack stack;        // 栈.用于储存分治范围
+Stack stack;        // Stack.For storage divide and conquer range

 int main(int argc, char* argv[])
 {	
 	int i;	
 	
 	//
-	// 初始化数组
+	// Initializing array
 	//
 	int list[] = {49, 38, 65, 97, 76};
 	int length = sizeof(list) / sizeof(list[0]);
@@ -18,12 +18,12 @@ int main(int argc, char* argv[])
 	InitStack(&stack); 
 	 
 	//
-	// 快速排序
+	// Quick sort
 	//
 	QuickSort(list, 0, length-1);
 	
 	//
-	// 输出排序后的结果
+	// Output the sorted result
 	//
 	for(i=0; i<length; i++)
 		printf("%d ", list[i]);
@@ -33,16 +33,16 @@ int main(int argc, char* argv[])

 /*
 function:
-	快速排序.按关键字递增排序.
+	Quick sort.Sort by keyword increments.

 parameter:
-	list -- 数组指针
-	left -- 分治范围(左边界)
-	right -- 分治范围(右边界)
+	list -- Pointer to an array
+	left -- Partition scope(The left border)
+	right -- Partition scope(The right border)
 */
 void QuickSort(int* list, int left, int right)
 {
-	int temp;			// 用于储存分区元素的临时变量
+	int temp;			// Temporary variables used to store partition elements
 	int i, j;			// Cursors at both ends of the i, j divide and conquer region are used to adjust the data within the partition scope
 	
 	//