Update comment

Author: ksw2000

Sorting/bubble-sort.c

@@ -10,7 +10,7 @@ void bubbleSort(int* list, int len) {
     int i, j;
     for (i = 0; i < len - 1; i++) {
         for (j = 0; j < len - 1 - i; j++) {
-            // swap list[j] and list[j+1] whenever list[j] > list[j+1]
+            // swap list[j] with list[j+1] whenever list[j] > list[j+1]
             if (list[j] > list[j + 1]) {
                 list[j] = list[j + 1] ^ list[j];
                 list[j + 1] = list[j + 1] ^ list[j];
@@ -32,11 +32,11 @@ int main() {
     int list[] = {8, 7, 5, 6, 4, 2, 3, 1};
     int len = sizeof(list) / sizeof(list[0]);
     printf("list: ");
-    // list: 8 7 5 6 4 2 3 1
     printList(list, len);
+    // list: 8 7 5 6 4 2 3 1
     bubbleSort(list, len);
     printf("sorted list: ");
-    // sorted list: 1 2 3 4 5 6 7 8
     printList(list, len);
+    // sorted list: 1 2 3 4 5 6 7 8
     return 0;
 }

Sorting/insertion-sort.c

@@ -10,7 +10,7 @@ void insertionSort(int* list, int len) {
     int i, j;
     for (i = 1; i < len; i++) {
         for (j = i; j > 0 && list[j] < list[j - 1]; j--) {
-            // swap list[j] and list[j-1]
+            // swap list[j] with list[j-1]
             list[j] = list[j] ^ list[j - 1];
             list[j - 1] = list[j] ^ list[j - 1];
             list[j] = list[j] ^ list[j - 1];
@@ -30,11 +30,11 @@ int main() {
     int list[] = {8, 7, 5, 6, 4, 2, 3, 1};
     int len = sizeof(list) / sizeof(list[0]);
     printf("list: ");
-    // list: 8 7 5 6 4 2 3 1
     printList(list, len);
+    // list: 8 7 5 6 4 2 3 1
     insertionSort(list, len);
     printf("sorted list: ");
-    // sorted list: 1 2 3 4 5 6 7 8
     printList(list, len);
+    // sorted list: 1 2 3 4 5 6 7 8
     return 0;
 }