Bubble short in string in c

Bubble Sort for Strings in C Programming

Bubble sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements if they are in the wrong order. It is called bubble sort because smaller elements "bubble" to the top of the array or string, while larger elements sink to the bottom.

To implement a bubble sort in C for strings, we can use the following algorithm:

1. Initialize two pointers, i and j, to the beginning of the array.
2. Compare the strings at indices i and j. If the string at index i is greater than the string at index j, swap them.
3. Increment j and repeat steps 2 and 3 until j reaches the end of the array.
4. Decrement i and repeat steps 2-4 until i reaches the beginning of the array.

Bubble short in string in c programming 

C programming

#include
void main()
{
    char s[20],t;
    int i,j,l;
    printf("Enter the string:\n");
    scanf("%s",s);
    printf("Before s=%s\n",s);
    for(l=0;s[l];l++);
    for(i=0;i<l-1;i++)
    {
      for(j=0;j<l-1-i;j++)
      {
        if(s[j]>s[j+1])
        {
            t=s[j];
            s[j]=s[j+1];
            s[j+1]=t;
        }
      }
    }
    printf("After s:%s\n",s);
}

Output:

Enter the string: mbadct
Before s=mbadct
After s:abcdmt

When applied to strings, bubble sort works by comparing pairs of adjacent strings and swapping them if they are in the wrong order. The comparison is usually done using the strcmp function, which compares two strings lexicographically (i.e., based on their alphabetical order).

C code implements the bubble sort algorithm for strings:

#include <stdio.h>
#include <string.h>

void bubble_sort(char **strings, int n) {
  int i, j;

  for (i = 0; i < n - 1; i++) {
    for (j = 0; j < n - i - 1; j++) {
      if (strcmp(strings[j], strings[j + 1]) > 0) {
        char *temp = strings[j];
        strings[j] = strings[j + 1];
        strings[j + 1] = temp;
      }
    }
  }
}

int main() {
  char *strings[] = {"Alice", "Bob", "Carol", "Dave", "Eve"};
  int n = sizeof(strings) / sizeof(strings[0]);

  printf("Unsorted strings:\n");
  for (int i = 0; i < n; i++) {
    printf("%s\n", strings[i]);
  }

  bubble_sort(strings, n);

  printf("\nSorted strings:\n");
  for (int i = 0; i < n; i++) {
    printf("%s\n", strings[i]);
  }

  return 0;
}

Output:

Unsorted strings:
Alice
Bob
Carol
Dave
Eve

Sorted strings:
Alice
Bob
Carol
Dave
Eve