Step by Step solution about How to resolve the algorithm Sorting algorithms/Bubble sort step by step in the C programming language

This C code performs bubble sort on an array of integers and then prints the sorted array. Here's a detailed explanation:

1. Bubble Sort Function (bubble_sort):

   • void bubble_sort(int *a, int n): This function takes an array a and its size n as parameters and sorts the array in ascending order.
   • int i, t, j = n, s = 1;: Initializes variables for loop counters i and j, a temporary variable t to store the exchanged elements, j to iterate through the array, and s to indicate whether any swaps were made during the current pass.
   • while (s): This is the main loop that continues until no swaps are made in a pass (i.e., s becomes 0).
   • The outer loop iterates from the second element (i = 1) to the j-th element.
   • The inner loop compares each element with the previous one and swaps them if the previous one is greater.
   • After each inner loop iteration, s is set to 1 if a swap was made, indicating that another pass is needed.
   • j is decremented after each outer loop iteration to reduce the sorted portion of the array.

2. Main Function (main):

   • int main() is the program's entry point.
   • It initializes an integer array a with unsorted values.
   • int n = sizeof a / sizeof a[0];: Calculates the size of the array a by dividing its total size in bytes by the size of each element (in this case, an integer).
   • It prints the original unsorted array using a loop.
   • bubble_sort(a, n);: Calls the bubble_sort function to sort the array a.
   • It prints the sorted array using another loop.
   • Finally, the program returns 0, indicating successful execution.

In summary, this code demonstrates the bubble sort algorithm to sort an array of integers in ascending order. It prints the unsorted and sorted arrays for comparison.

#include <stdio.h>

void bubble_sort (int *a, int n) {
    int i, t, j = n, s = 1;
    while (s) {
        s = 0;
        for (i = 1; i < j; i++) {
            if (a[i] < a[i - 1]) {
                t = a[i];
                a[i] = a[i - 1];
                a[i - 1] = t;
                s = 1;
            }
        }
        j--;
    }
}

int main () {
    int a[] = {4, 65, 2, -31, 0, 99, 2, 83, 782, 1};
    int n = sizeof a / sizeof a[0];
    int i;
    for (i = 0; i < n; i++)
        printf("%d%s", a[i], i == n - 1 ? "\n" : " ");
    bubble_sort(a, n);
    for (i = 0; i < n; i++)
        printf("%d%s", a[i], i == n - 1 ? "\n" : " ");
    return 0;
}