Retranslate the complete English edition from Simplified Chinese (#2010)

* Retranslate the complete English edition from Simplified Chinese

* Polish three English explanations after reader-focused review

en/codes/cpp/chapter_sorting/bubble_sort.cpp

@@ -8,13 +8,13 @@
 
 /* Bubble sort */
 void bubbleSort(vector<int> &nums) {
-    // Outer loop: unsorted range is [0, i]
+    // Outer loop: the unsorted range is [0, i]
     for (int i = nums.size() - 1; i > 0; i--) {
-        // Inner loop: swap the largest element in the unsorted range [0, i] to the rightmost end of that range
+        // Inner loop: move the largest element in the unsorted range [0, i] to its right end through swaps
         for (int j = 0; j < i; j++) {
             if (nums[j] > nums[j + 1]) {
                 // Swap nums[j] and nums[j + 1]
-                // Using std::swap() function here
+                // Use the std::swap() function here
                 swap(nums[j], nums[j + 1]);
             }
         }
@@ -23,33 +23,33 @@ void bubbleSort(vector<int> &nums) {
 
 /* Bubble sort (flag optimization)*/
 void bubbleSortWithFlag(vector<int> &nums) {
-    // Outer loop: unsorted range is [0, i]
+    // Outer loop: the unsorted range is [0, i]
     for (int i = nums.size() - 1; i > 0; i--) {
-        bool flag = false; // Initialize flag
-        // Inner loop: swap the largest element in the unsorted range [0, i] to the rightmost end of that range
+        bool flag = false; // Initialize the flag
+        // Inner loop: move the largest element in the unsorted range [0, i] to its right end through swaps
         for (int j = 0; j < i; j++) {
             if (nums[j] > nums[j + 1]) {
                 // Swap nums[j] and nums[j + 1]
-                // Using std::swap() function here
+                // Use the std::swap() function here
                 swap(nums[j], nums[j + 1]);
-                flag = true; // Record element swap
+                flag = true; // Record that a swap occurred
             }
         }
         if (!flag)
-            break; // No elements were swapped in this round of "bubbling", exit directly
+            break; // Exit immediately if this pass made no swaps
     }
 }
 
-/* Driver Code */
+/* Driver code */
 int main() {
     vector<int> nums = {4, 1, 3, 1, 5, 2};
     bubbleSort(nums);
-    cout << "After bubble sort completes, nums = ";
+    cout << "After bubble sort, nums = ";
     printVector(nums);
 
     vector<int> nums1 = {4, 1, 3, 1, 5, 2};
     bubbleSortWithFlag(nums1);
-    cout << "After bubble sort completes, nums1 = ";
+    cout << "After bubble sort, nums1 = ";
     printVector(nums1);
 
     return 0;

en/codes/cpp/chapter_sorting/bucket_sort.cpp

@@ -8,22 +8,22 @@
 
 /* Bucket sort */
 void bucketSort(vector<float> &nums) {
-    // Initialize k = n/2 buckets, expected to allocate 2 elements per bucket
+    // Initialize k = n/2 buckets, expecting 2 elements per bucket
     int k = nums.size() / 2;
     vector<vector<float>> buckets(k);
-    // 1. Distribute array elements into various buckets
+    // 1. Distribute the array elements among the buckets
     for (float num : nums) {
-        // Input data range is [0, 1), use num * k to map to index range [0, k-1]
+        // The input range is [0, 1); use num * k to map each value to an index in [0, k-1]
         int i = num * k;
-        // Add num to bucket bucket_idx
+        // Add num to bucket i
         buckets[i].push_back(num);
     }
     // 2. Sort each bucket
     for (vector<float> &bucket : buckets) {
-        // Use built-in sorting function, can also replace with other sorting algorithms
+        // Use the built-in sorting function, or replace it with another sorting algorithm
         sort(bucket.begin(), bucket.end());
     }
-    // 3. Traverse buckets to merge results
+    // 3. Traverse the buckets to combine the results
     int i = 0;
     for (vector<float> &bucket : buckets) {
         for (float num : bucket) {
@@ -32,12 +32,12 @@ void bucketSort(vector<float> &nums) {
     }
 }
 
-/* Driver Code */
+/* Driver code */
 int main() {
-    // Assume input data is floating point, interval [0, 1)
+    // Assume the input consists of floating-point numbers in [0, 1)
     vector<float> nums = {0.49f, 0.96f, 0.82f, 0.09f, 0.57f, 0.43f, 0.91f, 0.75f, 0.15f, 0.37f};
     bucketSort(nums);
-    cout << "After bucket sort completes, nums = ";
+    cout << "After bucket sort, nums = ";
     printVector(nums);
 
     return 0;

en/codes/cpp/chapter_sorting/counting_sort.cpp

@@ -7,20 +7,20 @@
 #include "../utils/common.hpp"
 
 /* Counting sort */
-// Simple implementation, cannot be used for sorting objects
+// Simple implementation; cannot be used to sort objects
 void countingSortNaive(vector<int> &nums) {
-    // 1. Count the maximum element m in the array
+    // 1. Find the maximum array element m
     int m = 0;
     for (int num : nums) {
         m = max(m, num);
     }
-    // 2. Count the occurrence of each number
-    // counter[num] represents the occurrence of num
+    // 2. Count the occurrences of each number
+    // counter[num] is the number of occurrences of num
     vector<int> counter(m + 1, 0);
     for (int num : nums) {
         counter[num]++;
     }
-    // 3. Traverse counter, filling each element back into the original array nums
+    // 3. Traverse counter and fill the original array nums with the elements
     int i = 0;
     for (int num = 0; num < m + 1; num++) {
         for (int j = 0; j < counter[num]; j++, i++) {
@@ -30,47 +30,47 @@ void countingSortNaive(vector<int> &nums) {
 }
 
 /* Counting sort */
-// Complete implementation, can sort objects and is a stable sort
+// Stable implementation that can be adapted to sort objects
 void countingSort(vector<int> &nums) {
-    // 1. Count the maximum element m in the array
+    // 1. Find the maximum array element m
     int m = 0;
     for (int num : nums) {
         m = max(m, num);
     }
-    // 2. Count the occurrence of each number
-    // counter[num] represents the occurrence of num
+    // 2. Count the occurrences of each number
+    // counter[num] is the number of occurrences of num
     vector<int> counter(m + 1, 0);
     for (int num : nums) {
         counter[num]++;
     }
-    // 3. Calculate the prefix sum of counter, converting "occurrence count" to "tail index"
-    // counter[num]-1 is the last index where num appears in res
+    // 3. Compute prefix sums of counter to convert occurrence counts into end positions
+    // That is, counter[num]-1 is the index of the last occurrence of num in res
     for (int i = 0; i < m; i++) {
         counter[i + 1] += counter[i];
     }
-    // 4. Traverse nums in reverse order, placing each element into the result array res
-    // Initialize the array res to record results
+    // 4. Traverse nums in reverse and place each element in the result array res
+    // Initialize array res to store the result
     int n = nums.size();
     vector<int> res(n);
     for (int i = n - 1; i >= 0; i--) {
         int num = nums[i];
         res[counter[num] - 1] = num; // Place num at the corresponding index
-        counter[num]--;              // Decrement the prefix sum by 1, getting the next index to place num
+        counter[num]--;              // Decrement the prefix sum by 1 to determine where to place the next occurrence of num
     }
-    // Use result array res to overwrite the original array nums
+    // Overwrite the original array nums with the result array res
     nums = res;
 }
 
-/* Driver Code */
+/* Driver code */
 int main() {
     vector<int> nums = {1, 0, 1, 2, 0, 4, 0, 2, 2, 4};
     countingSortNaive(nums);
-    cout << "After counting sort (cannot sort objects) completes, nums = ";
+    cout << "After counting sort (without support for objects), nums = ";
     printVector(nums);
 
     vector<int> nums1 = {1, 0, 1, 2, 0, 4, 0, 2, 2, 4};
     countingSort(nums1);
-    cout << "After counting sort completes, nums1 = ";
+    cout << "After counting sort, nums1 = ";
     printVector(nums1);
 
     return 0;

en/codes/cpp/chapter_sorting/heap_sort.cpp

@@ -6,10 +6,10 @@
 
 #include "../utils/common.hpp"
 
-/* Heap length is n, start heapifying node i, from top to bottom */
+/* Sift down from node i in a heap of size n */
 void siftDown(vector<int> &nums, int n, int i) {
     while (true) {
-        // If node i is largest or indices l, r are out of bounds, no need to continue heapify, break
+        // Find the node with the largest value among i, l, and r, and store its index in ma
         int l = 2 * i + 1;
         int r = 2 * i + 2;
         int ma = i;
@@ -17,37 +17,37 @@ void siftDown(vector<int> &nums, int n, int i) {
             ma = l;
         if (r < n && nums[r] > nums[ma])
             ma = r;
-        // Swap two nodes
+        // Stop if node i is largest or both child indices l and r are out of bounds
         if (ma == i) {
             break;
         }
-        // Swap two nodes
+        // Swap the two nodes
         swap(nums[i], nums[ma]);
-        // Loop downwards heapification
+        // Continue sifting down
         i = ma;
     }
 }
 
 /* Heap sort */
 void heapSort(vector<int> &nums) {
-    // Build heap operation: heapify all nodes except leaves
+    // Build the heap by sifting down from every non-leaf node
     for (int i = nums.size() / 2 - 1; i >= 0; --i) {
         siftDown(nums, nums.size(), i);
     }
-    // Extract the largest element from the heap and repeat for n-1 rounds
+    // Extract the largest element from the heap, repeating for n-1 rounds
     for (int i = nums.size() - 1; i > 0; --i) {
-        // Delete node
+        // Swap the root with the rightmost leaf on the last level (the first and last elements of the current heap)
         swap(nums[0], nums[i]);
-        // Start heapifying the root node, from top to bottom
+        // Sift down starting at the root
         siftDown(nums, i, 0);
     }
 }
 
-/* Driver Code */
+/* Driver code */
 int main() {
     vector<int> nums = {4, 1, 3, 1, 5, 2};
     heapSort(nums);
-    cout << "After heap sort completes, nums = ";
+    cout << "After heap sort, nums = ";
     printVector(nums);
 
     return 0;

en/codes/cpp/chapter_sorting/insertion_sort.cpp

@@ -8,23 +8,23 @@
 
 /* Insertion sort */
 void insertionSort(vector<int> &nums) {
-    // Outer loop: sorted interval is [0, i-1]
+    // Outer loop: the sorted range is [0, i-1]
     for (int i = 1; i < nums.size(); i++) {
         int base = nums[i], j = i - 1;
-        // Inner loop: insert base into the correct position within the sorted interval [0, i-1]
+        // Inner loop: insert base at the correct position in the sorted range [0, i-1]
         while (j >= 0 && nums[j] > base) {
-            nums[j + 1] = nums[j]; // Move nums[j] to the right by one position
+            nums[j + 1] = nums[j]; // Shift nums[j] one position to the right
             j--;
         }
-        nums[j + 1] = base; // Assign base to the correct position
+        nums[j + 1] = base; // Place base at the correct position
     }
 }
 
-/* Driver Code */
+/* Driver code */
 int main() {
     vector<int> nums = {4, 1, 3, 1, 5, 2};
     insertionSort(nums);
-    cout << "After insertion sort completes, nums = ";
+    cout << "After insertion sort, nums = ";
     printVector(nums);
 
     return 0;

en/codes/cpp/chapter_sorting/merge_sort.cpp

@@ -6,14 +6,14 @@
 
 #include "../utils/common.hpp"
 
-/* Merge left subarray and right subarray */
+/* Merge the left and right subarrays */
 void merge(vector<int> &nums, int left, int mid, int right) {
-    // Left subarray interval is [left, mid], right subarray interval is [mid+1, right]
-    // Create a temporary array tmp to store the merged results
+    // The left subarray spans [left, mid], and the right subarray spans [mid+1, right]
+    // Create a temporary array tmp to store the merged result
     vector<int> tmp(right - left + 1);
-    // Initialize the start indices of the left and right subarrays
+    // Initialize the starting indices of the left and right subarrays
     int i = left, j = mid + 1, k = 0;
-    // While both subarrays still have elements, compare and copy the smaller element into the temporary array
+    // While both subarrays have elements remaining, compare them and copy the smaller element into the temporary array
     while (i <= mid && j <= right) {
         if (nums[i] <= nums[j])
             tmp[k++] = nums[i++];
@@ -27,7 +27,7 @@ void merge(vector<int> &nums, int left, int mid, int right) {
     while (j <= right) {
         tmp[k++] = nums[j++];
     }
-    // Copy the elements from the temporary array tmp back to the original array nums at the corresponding interval
+    // Copy the elements of temporary array tmp back into the corresponding range of the original array nums
     for (k = 0; k < tmp.size(); k++) {
         nums[left + k] = tmp[k];
     }
@@ -35,23 +35,23 @@ void merge(vector<int> &nums, int left, int mid, int right) {
 
 /* Merge sort */
 void mergeSort(vector<int> &nums, int left, int right) {
-    // Termination condition
+    // Base case
     if (left >= right)
-        return; // Terminate recursion when subarray length is 1
-    // Divide and conquer stage
-    int mid = left + (right - left) / 2;    // Calculate midpoint
-    mergeSort(nums, left, mid);      // Recursively process the left subarray
-    mergeSort(nums, mid + 1, right); // Recursively process the right subarray
-    // Merge stage
+        return; // Stop recursing when the subarray has at most one element
+    // Divide phase
+    int mid = left + (right - left) / 2;    // Calculate the midpoint
+    mergeSort(nums, left, mid);      // Recurse on the left subarray
+    mergeSort(nums, mid + 1, right); // Recurse on the right subarray
+    // Merge phase
     merge(nums, left, mid, right);
 }
 
-/* Driver Code */
+/* Driver code */
 int main() {
     /* Merge sort */
     vector<int> nums = {7, 3, 2, 6, 0, 1, 5, 4};
     mergeSort(nums, 0, nums.size() - 1);
-    cout << "After merge sort completes, nums = ";
+    cout << "After merge sort, nums = ";
     printVector(nums);
 
     return 0;

en/codes/cpp/chapter_sorting/quick_sort.cpp

@@ -9,30 +9,30 @@
 /* Quick sort class */
 class QuickSort {
   private:
-    /* Sentinel partition */
+    /* Two-pointer partitioning */
     static int partition(vector<int> &nums, int left, int right) {
         // Use nums[left] as the pivot
         int i = left, j = right;
         while (i < j) {
             while (i < j && nums[j] >= nums[left])
-                j--;                // Search from right to left for the first element smaller than the pivot
+                j--;                // Scan from right to left for the first element smaller than the pivot
             while (i < j && nums[i] <= nums[left])
-                i++;                // Search from left to right for the first element greater than the pivot
+                i++;                // Scan from left to right for the first element larger than the pivot
             swap(nums[i], nums[j]); // Swap these two elements
         }
-        swap(nums[i], nums[left]);  // Swap the pivot to the boundary between the two subarrays
-        return i;                   // Return the index of the pivot
+        swap(nums[i], nums[left]);  // Swap the pivot into the boundary position between the two subarrays
+        return i;                   // Return the pivot index
     }
 
   public:
     /* Quick sort */
     static void quickSort(vector<int> &nums, int left, int right) {
-        // Terminate recursion when subarray length is 1
+        // Stop recursing when the subarray has at most one element
         if (left >= right)
             return;
-        // Sentinel partition
+        // Two-pointer partitioning
         int pivot = partition(nums, left, right);
-        // Recursively process the left subarray and right subarray
+        // Recurse on the left and right subarrays
         quickSort(nums, left, pivot - 1);
         quickSort(nums, pivot + 1, right);
     }
@@ -45,40 +45,40 @@ class QuickSortMedian {
     static int medianThree(vector<int> &nums, int left, int mid, int right) {
         int l = nums[left], m = nums[mid], r = nums[right];
         if ((l <= m && m <= r) || (r <= m && m <= l))
-            return mid; // m is between l and r
+            return mid; // m lies between l and r
         if ((m <= l && l <= r) || (r <= l && l <= m))
-            return left; // l is between m and r
+            return left; // l lies between m and r
         return right;
     }
 
-    /* Sentinel partition (median of three) */
+    /* Two-pointer partitioning (median of three) */
     static int partition(vector<int> &nums, int left, int right) {
         // Select the median of three candidate elements
         int med = medianThree(nums, left, (left + right) / 2, right);
-        // Swap the median to the array's leftmost position
+        // Swap the median into the leftmost position of the current subarray
         swap(nums[left], nums[med]);
         // Use nums[left] as the pivot
         int i = left, j = right;
         while (i < j) {
             while (i < j && nums[j] >= nums[left])
-                j--;                // Search from right to left for the first element smaller than the pivot
+                j--;                // Scan from right to left for the first element smaller than the pivot
             while (i < j && nums[i] <= nums[left])
-                i++;                // Search from left to right for the first element greater than the pivot
+                i++;                // Scan from left to right for the first element larger than the pivot
             swap(nums[i], nums[j]); // Swap these two elements
         }
-        swap(nums[i], nums[left]);  // Swap the pivot to the boundary between the two subarrays
-        return i;                   // Return the index of the pivot
+        swap(nums[i], nums[left]);  // Swap the pivot into the boundary position between the two subarrays
+        return i;                   // Return the pivot index
     }
 
   public:
     /* Quick sort */
     static void quickSort(vector<int> &nums, int left, int right) {
-        // Terminate recursion when subarray length is 1
+        // Stop recursing when the subarray has at most one element
         if (left >= right)
             return;
-        // Sentinel partition
+        // Two-pointer partitioning
         int pivot = partition(nums, left, right);
-        // Recursively process the left subarray and right subarray
+        // Recurse on the left and right subarrays
         quickSort(nums, left, pivot - 1);
         quickSort(nums, pivot + 1, right);
     }
@@ -87,58 +87,58 @@ class QuickSortMedian {
 /* Quick sort class (recursion depth optimization) */
 class QuickSortTailCall {
   private:
-    /* Sentinel partition */
+    /* Two-pointer partitioning */
     static int partition(vector<int> &nums, int left, int right) {
         // Use nums[left] as the pivot
         int i = left, j = right;
         while (i < j) {
             while (i < j && nums[j] >= nums[left])
-                j--;                // Search from right to left for the first element smaller than the pivot
+                j--;                // Scan from right to left for the first element smaller than the pivot
             while (i < j && nums[i] <= nums[left])
-                i++;                // Search from left to right for the first element greater than the pivot
+                i++;                // Scan from left to right for the first element larger than the pivot
             swap(nums[i], nums[j]); // Swap these two elements
         }
-        swap(nums[i], nums[left]);  // Swap the pivot to the boundary between the two subarrays
-        return i;                   // Return the index of the pivot
+        swap(nums[i], nums[left]);  // Swap the pivot into the boundary position between the two subarrays
+        return i;                   // Return the pivot index
     }
 
   public:
     /* Quick sort (recursion depth optimization) */
     static void quickSort(vector<int> &nums, int left, int right) {
-        // Terminate when subarray length is 1
+        // Stop when the subarray has at most one element
         while (left < right) {
-            // Sentinel partition operation
+            // Perform two-pointer partitioning
             int pivot = partition(nums, left, right);
-            // Perform quick sort on the shorter of the two subarrays
+            // Apply quick sort to the shorter of the two subarrays
             if (pivot - left < right - pivot) {
                 quickSort(nums, left, pivot - 1); // Recursively sort the left subarray
-                left = pivot + 1;                 // Remaining unsorted interval is [pivot + 1, right]
+                left = pivot + 1;                 // The remaining unsorted range is [pivot + 1, right]
             } else {
                 quickSort(nums, pivot + 1, right); // Recursively sort the right subarray
-                right = pivot - 1;                 // Remaining unsorted interval is [left, pivot - 1]
+                right = pivot - 1;                 // The remaining unsorted range is [left, pivot - 1]
             }
         }
     }
 };
 
-/* Driver Code */
+/* Driver code */
 int main() {
     /* Quick sort */
     vector<int> nums{2, 4, 1, 0, 3, 5};
     QuickSort::quickSort(nums, 0, nums.size() - 1);
-    cout << "After quick sort completes, nums = ";
+    cout << "After quick sort, nums = ";
     printVector(nums);
 
-    /* Quick sort (recursion depth optimization) */
+    /* Quick sort (median pivot optimization) */
     vector<int> nums1 = {2, 4, 1, 0, 3, 5};
     QuickSortMedian::quickSort(nums1, 0, nums1.size() - 1);
-    cout << "After quick sort (median pivot optimization), nums = ";
+    cout << "After quick sort with median-of-three pivot selection, nums1 = ";
     printVector(nums1);
 
     /* Quick sort (recursion depth optimization) */
     vector<int> nums2 = {2, 4, 1, 0, 3, 5};
     QuickSortTailCall::quickSort(nums2, 0, nums2.size() - 1);
-    cout << "After quick sort (recursion depth optimization), nums = ";
+    cout << "After quick sort with recursion-depth optimization, nums2 = ";
     printVector(nums2);
 
     return 0;

en/codes/cpp/chapter_sorting/radix_sort.cpp

@@ -6,59 +6,59 @@
 
 #include "../utils/common.hpp"
 
-/* Get the k-th digit of element num, where exp = 10^(k-1) */
+/* Get the k-th digit of num, where exp = 10^(k-1) */
 int digit(int num, int exp) {
-    // Passing exp instead of k can avoid repeated expensive exponentiation here
+    // Passing exp instead of k avoids repeatedly performing expensive exponentiation here
     return (num / exp) % 10;
 }
 
-/* Counting sort (based on nums k-th digit) */
+/* Counting sort (sort nums by the k-th digit) */
 void countingSortDigit(vector<int> &nums, int exp) {
-    // Decimal digit range is 0~9, therefore need a bucket array of length 10
+    // Decimal digits range from 0 to 9, so the bucket array needs length 10
     vector<int> counter(10, 0);
     int n = nums.size();
-    // Count the occurrence of digits 0~9
+    // Count the occurrences of each digit from 0 to 9
     for (int i = 0; i < n; i++) {
-        int d = digit(nums[i], exp); // Get the k-th digit of nums[i], noted as d
-        counter[d]++;                // Count the occurrence of digit d
+        int d = digit(nums[i], exp); // Get the k-th digit of nums[i] and store it in d
+        counter[d]++;                // Count the occurrences of digit d
     }
-    // Calculate prefix sum, converting "occurrence count" into "array index"
+    // Compute prefix sums to convert occurrence counts into array positions
     for (int i = 1; i < 10; i++) {
         counter[i] += counter[i - 1];
     }
-    // Traverse in reverse, based on bucket statistics, place each element into res
+    // Traverse in reverse and place each element into res according to the bucket counts
     vector<int> res(n, 0);
     for (int i = n - 1; i >= 0; i--) {
         int d = digit(nums[i], exp);
-        int j = counter[d] - 1; // Get the index j for d in the array
+        int j = counter[d] - 1; // Get the destination index j for digit d in the array
         res[j] = nums[i];       // Place the current element at index j
-        counter[d]--;           // Decrease the count of d by 1
+        counter[d]--;           // Decrease the count for d by 1
     }
-    // Use result to overwrite the original array nums
+    // Overwrite the original array nums with the result
     for (int i = 0; i < n; i++)
         nums[i] = res[i];
 }
 
 /* Radix sort */
 void radixSort(vector<int> &nums) {
-    // Get the maximum element of the array, used to determine the maximum number of digits
+    // Get the largest array element to determine the maximum number of digits
     int m = *max_element(nums.begin(), nums.end());
-    // Traverse from the lowest to the highest digit
+    // Process digits from least significant to most significant
     for (int exp = 1; exp <= m; exp *= 10)
-        // Perform counting sort on the k-th digit of array elements
+        // Apply counting sort to the k-th digit of the array elements
         // k = 1 -> exp = 1
         // k = 2 -> exp = 10
-        // i.e., exp = 10^(k-1)
+        // That is, exp = 10^(k-1)
         countingSortDigit(nums, exp);
 }
 
-/* Driver Code */
+/* Driver code */
 int main() {
     // Radix sort
     vector<int> nums = {10546151, 35663510, 42865989, 34862445, 81883077,
                         88906420, 72429244, 30524779, 82060337, 63832996};
     radixSort(nums);
-    cout << "After radix sort completes, nums = ";
+    cout << "After radix sort, nums = ";
     printVector(nums);
 
     return 0;

en/codes/cpp/chapter_sorting/selection_sort.cpp

@@ -9,25 +9,25 @@
 /* Selection sort */
 void selectionSort(vector<int> &nums) {
     int n = nums.size();
-    // Outer loop: unsorted interval is [i, n-1]
+    // Outer loop: the unsorted range is [i, n-1]
     for (int i = 0; i < n - 1; i++) {
-        // Inner loop: find the smallest element within the unsorted interval
+        // Inner loop: find the smallest element in the unsorted range
         int k = i;
         for (int j = i + 1; j < n; j++) {
             if (nums[j] < nums[k])
                 k = j; // Record the index of the smallest element
         }
-        // Swap the smallest element with the first element of the unsorted interval
+        // Swap the smallest element with the first element of the unsorted range
         swap(nums[i], nums[k]);
     }
 }
 
-/* Driver Code */
+/* Driver code */
 int main() {
     vector<int> nums = {4, 1, 3, 1, 5, 2};
     selectionSort(nums);
 
-    cout << "After selection sort completes, nums = ";
+    cout << "After selection sort, nums = ";
     printVector(nums);
 
     return 0;