Merge pull request #254 from antonte/bubble-sort-c

Match bubble sort C implementation with Julia

Author: Gathros

chapters/algorithms/bubble_sort/bubble_sort.md

@@ -13,7 +13,7 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
 {% sample lang="cs" %}
 [import:9-27, lang:"csharp"](code/csharp/BubbleSort.cs)
 {% sample lang="c" %}
-[import:4-22, lang:"c_cpp"](code/c/bubble_sort.c)
+[import:11-21, lang:"c_cpp"](code/c/bubble_sort.c)
 {% sample lang="java" %}
 [import:2-12, lang:"java"](code/java/bubble.java)
 {% sample lang="js" %}

chapters/algorithms/bubble_sort/code/c/bubble_sort.c

@@ -1,42 +1,35 @@
 #include <stdio.h>
-#include <stddef.h>
+
+void print_range(int *array, size_t n) {
+    for (size_t i = 0; i < n; ++i) {
+        printf("%d ", array[i]);
+    }
+    printf("\n");
+}
 
 void bubble_sort(int *array, size_t n) {
-    int swapped = 0;
-    for (size_t i = 0; i < n - 1; ++i) {
-        swapped = 0;
-        for (size_t j = 0; j < n - i - 1; ++j) {
+    for (size_t i = 0; i < n; ++i) {
+        for (size_t j = 0; j < n - 1; ++j) {
             if (array[j] > array[j + 1]) {
                 int tmp = array[j];
                 array[j] = array[j + 1];
                 array[j + 1] = tmp;
-
-                swapped = 1;
             }
         }
-
-        if (!swapped) {
-            break;
-        }
     }
 }
 
 int main() {
-    int array[10] = {1, 45, 756, 4569, 56, 3, 8, 5, -10, -4};
+    int array[] = {1, 45, 756, 4569, 56, 3, 8, 5, -10, -4};
+    size_t N = sizeof(array) / sizeof(*array);
 
     printf("Unsorted array:\n");
-    for (size_t i = 0; i < 10; ++i) {
-        printf("%d ", array[i]);
-    }
-    printf("\n\n");
+    print_range(array, N);
 
-    bubble_sort(array, 10);
+    bubble_sort(array, N);
 
-    printf("Sorted array:\n");
-    for (size_t i = 0; i < 10; ++i) {
-        printf("%d ", array[i]);
-    }
-    printf("\n");
+    printf("\nSorted array:\n");
+    print_range(array, N);
 
     return 0;
 }