C: Implement bubble sort.

https://github.com/pereiradaniel/c_programs/blob/master/bubble_sort.c

#include <stdio.h>
#include <stdbool.h>

void swap(int *x, int *y)
{
    bool swapped = false;
    // compares and swaps if necessary
    while (*x > *y)
    {
        printf("Comparing %d and %d\n", *x, *y);
        int temp = *y;
        *y = *x;
        *x = temp;
    }
    return;
}

void bubble_sort(int a[], int length)
{
    bool swapped = false;
    int i = 0;
    do {
        swapped = false;
        for (int j = 0; j < length - 1 - i; ++j)
        {
            swap(&a[j], &a[j+1]);
            swapped = true;
        }
        ++i;
    } while (swapped);
}

void display(int x[], int length)
{
    for (int i=0; i < length; ++i)
        printf("%d\n", x[i]);
}

int main()
{
    int a[] = {7,1,3,9,0,2,4,5,8};
    int b[] = {12,345,12,456,23,34,546,2,34,5,92,74,2829,4729,273,84721,372};
    int length = sizeof(a) / sizeof(int);

    bubble_sort(a, length);
    bubble_sort(b, sizeof(b) / sizeof(int));

    display(a, length);
    display(b, sizeof(b) / sizeof(int));

    return 0;
}

Popular posts from this blog

C++ Crash Course: Solutions to Exercises in Part 1, Chapter 1.

For the last while, I have been busy with ESP32 and Arduino programming, but now I finally have time to ram through this book and the exercises. There are a few repositories on Github where people have offered solutions to some of these exercises, but I find that they are often not complete. Therefore, I am endeavouring to make a more complete listing, or at least fill in some of the holes. Here is a video and a link to the repository for the solutions to Part 1, Chapter 1. The exercises can be found at the end of each chapter. I am back-tracking a bit from where I am in Part 1 Chapter 5, which is where I am currently studying. Github: https://github.com/pereiradaniel/CPP_CRASH_COURSE/tree/master/P1C1/EXERCISES Video: C++ Crash Course: Solutions to Exercises in Part 1, Chapter 1.
Read more

C++ Crash Course: Solution to Exercise 3-4.

Image
My solution to Exercise 3-4 from Part 1, Chapter 3 of C++ Crash Course. This one was fairly straightforward, but it illustrates a very important thing on line 13. When you assign new_value to the reference original_ref , it assigns the value to the int that original_ref is pointing to. The result is that new_value and original both have the same value, 200. Github: https://github.com/pereiradaniel/CPP_CRASH_COURSE/blob/master/P1C3/EXERCISES/3_4.cpp Youtube: C++ Crash Course: Solution to Exercise 3-4.
Read more