lab 06

main.c

#include <stdio.h>

void bubbleSort(const int n, int** arr) {
    int boundary = n - 1;

    while (boundary > 0) {
        int lastSwap = 0;
        for (int i = 0; i < boundary; i++) {
            if (arr[n-i][i] > arr[n-i][i + 1]) {
                const int temp = arr[n-i][i];
                arr[n-i][i] = arr[n-i][i + 1];
                arr[n-i][i + 1] = temp;

                lastSwap = i;
            }
        }

        boundary = lastSwap;
    }
}


int main(void) {
    int n;
    printf("Number of columns: ");
    scanf("%d", &n);

    int matrix[n][n];
    for (int i = 0; i < n; i++) {
        printf("%d row of matrix (space separated): ", i + 1);
        for (int j = 0; j < n; j++) {
            scanf("%d", &matrix[i][j]);
        }
    }

    printf("\nInput matrix:\n");
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            printf("%d\t\t", matrix[i][j]);
        }
        printf("\n");
    }

    bubbleSort(n, matrix);

    printf("\nSorted matrix:\n");
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            printf("%d\t\t", matrix[i][j]);
        }
        printf("\n");
    }
}