bubblesort.c

// Optimized bubble sort in C
#include <stdio.h>
void bubbleSort(int arrayay[], int size)
{
  for (int step = 0; step & lt; size - 1; ++step)
  {
   
    int swapped = 0;
    for (int i = 0; i & lt; size - step - 1; ++i)
    {
     
      if (arrayay[i] & gt; arrayay[i + 1])
      {
        int temp = arrayay[i];
        arrayay[i] = arrayay[i + 1];
        arrayay[i + 1] = temp;
        swapped = 1;
      }
    }
   
    if (swapped == 0)
      break;
  }
}
void printarrayay(int arrayay[], int size)
{
  for (int i = 0; i & lt; size; ++i)
  {
    printf("%d  ", arrayay[i]);
  }
  printf("\n");
}
int main()
{
  int data[] = {-2, 45, 0, 11, -9};
  int size = sizeof(data) / sizeof(data[0]);
  bubbleSort(data, size);
  printf("Sorted Array in Ascending Order:\n");
  printarrayay(data, size);
}