Translate Portuguese to English in MergeSort.java (resolves #182)

Author: Luka

src/java/MergeSort.java

@@ -1,41 +1,41 @@
 class MergeSort {
-  void merge(int vetor[], int inicio, int meio, int fim) {
-    int n1 = meio - inicio + 1;
-    int n2 = fim - meio;
-    int Inicial[] = new int[n1];
-    int Final[] = new int[n2];
-    for (int i = 0; i < n1; ++i) Inicial[i] = vetor[inicio + i];
-    for (int j = 0; j < n2; ++j) Final[j] = vetor[meio + 1 + j];
+  void merge(int array[], int start, int middle, int end) {
+    int n1 = middle - start + 1;
+    int n2 = end - middle;
+    int Left[] = new int[n1];
+    int Right[] = new int[n2];
+    for (int i = 0; i < n1; ++i) Left[i] = array[start + i];
+    for (int j = 0; j < n2; ++j) Right[j] = array[middle + 1 + j];
     int i = 0, j = 0;
-    int k = inicio;
+    int k = start;
     while (i < n1 && j < n2) {
-      if (Inicial[i] <= Final[j]) {
-        vetor[k] = Inicial[i];
+      if (Left[i] <= Right[j]) {
+        array[k] = Left[i];
         i++;
       } else {
-        vetor[k] = Final[j];
+        array[k] = Right[j];
         j++;
       }
       k++;
     }
     while (i < n1) {
-      vetor[k] = Inicial[i];
+      array[k] = Left[i];
       i++;
       k++;
     }
     while (j < n2) {
-      vetor[k] = Final[j];
+      array[k] = Right[j];
       j++;
       k++;
     }
   }
 
-  void sort(int vetor[], int inicio, int fim) {
-    if (inicio < fim) {
-      int meio = (inicio + fim) / 2;
-      sort(vetor, inicio, meio);
-      sort(vetor, meio + 1, fim);
-      merge(vetor, inicio, meio, fim);
+  void sort(int array[], int start, int end) {
+    if (start < end) {
+      int middle = (start + end) / 2;
+      sort(array, start, middle);
+      sort(array, middle + 1, end);
+      merge(array, start, middle, end);
     }
   }
 }