按行排序矩阵(c编程)

#include <stdio.h>

void sortMatrixRows(int rows, int cols, int matrix[rows][cols]) {
    for (int i = 0; i < rows; i++) {
        // 使用冒泡排序对每一行进行排序
        for (int j = 0; j < cols-1; j++) {
            for (int k = 0; k < cols-j-1; k++) {
                if (matrix[i][k] > matrix[i][k+1]) {
                    // 交换元素位置
                    int temp = matrix[i][k];
                    matrix[i][k] = matrix[i][k+1];
                    matrix[i][k+1] = temp;
                }
            }
        }
    }
}

int main() {
    int rows, cols;

    printf("Enter the number of rows in the matrix: ");
    scanf("%d", &rows);
    printf("Enter the number of columns in the matrix: ");
    scanf("%d", &cols);

    int matrix[rows][cols];

    printf("Enter the elements of the matrix:\n");
    for (int i = 0; i < rows; i++) {
        for (int j = 0; j < cols; j++) {
            scanf("%d", &matrix[i][j]);
        }
    }

    sortMatrixRows(rows, cols, matrix);

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

    return 0;
}