Translated comments in CountingSort

Author: ricardocarva

src/cpp/CountingSort.cpp

@@ -9,17 +9,17 @@ vector<int> counting_sort(vector<int>& nums) {
 
     // nums = {5, 0, 1, 2, 3, 5, 3, 0, 9, 4}
     // max = 9
-    // vector nums contem elementos entre [0 .. max]
+    // The vector contains numbers between [0 .. max]
     auto max = *max_element(nums.begin(), nums.end());
 
 
-    // cria um vector com max + 1 posicoes para contar ocorrências de cada elemento
-    //            0  1  2  3  4  5  6  7  8  9   -> elementos possiveis de ocorrer no vector nums
-    //counting = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}
+    // Creates a vector with max + 1 positions to count occurrences of each element
+    //            0  1  2  3  4  5  6  7  8  9   -> possible elements to occur in the vector nums
+    // Counting = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}
     vector<int> counting(max+1);
 
 
-    // conta ocorrencias de cada elemento
+    // Counts occurrences of each element
     // nums = {5, 0, 1, 2, 3, 5, 3, 0, 9, 4}
     //
     //             0  1  2  3  4  5  6  7  8  9
@@ -30,8 +30,8 @@ vector<int> counting_sort(vector<int>& nums) {
     }
 
 
-    // agora, counting = {2, 3, 4, 6, 7, 9, 9, 9, 9, 10}
-    // sera utilizado para determinar as posicoes dos elementos no vector ordenado 
+    // Now, counting = {2, 3, 4, 6, 7, 9, 9, 9, 9, 10}
+    // It will be used to determine the positions of the elements in the ordered vector
     for (size_t i = 1; i < counting.size(); i++) {
 
         counting[i] += counting[i-1];
@@ -41,29 +41,29 @@ vector<int> counting_sort(vector<int>& nums) {
 
     /*  
 
-        O proximo loop coloca os numeros em suas devidas posicoes no vetor ordenado
-        i = itera pelos elementos de nums
-        counting[i] -1 é a posicao que o elemento i devee assumir no vetor ordenado
+        The next loop places the numbers in their proper positions in the ordered vector
+        i = iterates through the elements of nums
+        counting[i] -1 is the position that element i must assume in the ordered vector
 
-        Os 3 primeiros passos seriam:
+        The first 3 steps would be:
 
         nums = {5, 0, 1, 2, 3, 5, 3, 0, 9, 4}
         counting = {2, 3, 4, 6, 7, 9, 9, 9, 9, 10}
         sorted = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}
         
-        passo 1:
+        Step 1:
             i = 5
             counting[i] => counting[5] => 9
             sorted[9 - 1] => sorted[8] = i => sorted[8] = 5 
             sorted = {0, 0, 0, 0, 0, 0, 0, 0, 5, 0}
 
-        passo 2:
+        Step 2:
             i = 0
             counting[i] => counting[0] => 2
             sorted[2 - 1] => sorted[1] = i => sorted[1] = 0
             sorted = {0, 0, 0, 0, 0, 0, 0, 0, 5, 0}
 
-        passo 3:
+        Step 3:
             i = 1
             counting[i] => counting[1] => 3
             sorted[3 - 1] => sorted[2] = i => sorted[2] = 1