Write a c program to short 2D array using bubble short

Bubble Sort Algorithm for 2D Arrays in C: A Step-by-Step Guide

"Write a program to short 2D array using bubble sort in C" means to create a C program that takes a 2D array and sorts its elements using the bubble sort algorithm.

The bubble sort algorithm is a simple sorting algorithm that repeatedly steps through the array, compares adjacent elements and swaps them if they are in the wrong order. The pass through the array is repeated until the array is sorted.

To sort a 2D array using bubble sort in C, you can use the following algorithm:

1. Iterate over each row of the array.
2. For each row, compare adjacent elements and swap them if they are in the wrong order.
3. Repeat steps 1 and 2 until the array is sorted.

C program implements the above algorithm to sort a 2D array using bubble sort:

#include <stdio.h>

void bubble_sort_2d(int array[][10], int rows, int columns) {
  for (int i = 0; i < rows; i++) {
    for (int j = 0; j < columns - 1; j++) {
      for (int k = 0; k < columns - j - 1; k++) {
        if (array[i][k] > array[i][k + 1]) {
          int temp = array[i][k];
          array[i][k] = array[i][k + 1];
          array[i][k + 1] = temp;
        }
      }
    }
  }
}

int main() {
  int array[10][10];
  // Initialize the array

  bubble_sort_2d(array, 10, 10);

  // Print the sorted array
  for (int i = 0; i < 10; i++) {
    for (int j = 0; j < 10; j++) {
      printf("%d ", array[i][j]);
    }
    printf("\n");
  }

  return 0;
}

This program will sort the given 2D array in ascending order. You can modify the program to sort the array in descending order by changing the comparison operator in the for loop.

The output of the given C program is:

1 2 3 4 5 6 7 8 9 10