Question

Write a program in c to sort the element array in descending order using bubble shory technique

Answer 1

Bubble sort algorithm implementation in C


/* Bubble sort code */   #include <stdio.h>   int main() { int array[100], n, c, d, swap;   printf("Enter number of elements\n"); scanf("%d", &n);   printf("Enter %d integers\n", n);   for (c = 0; c < n; c++) scanf("%d", &array[c]);   for (c = 0 ; c < n - 1; c++) { for (d = 0 ; d < n - c - 1; d++) { if (array[d] > array[d+1]) /* For decreasing order use < */ { swap = array[d]; array[d] = array[d+1]; array[d+1] = swap; } } }   printf("Sorted list in ascending order:\n");   for (c = 0; c < n; c++) printf("%d\n", array[c]);   return 0; }
Bubble sort in C language using function

#include <stdio.h>   void bubble_sort(long [], long);   int main() { long array[100], n, c, d, swap;   printf("Enter number of elements\n"); scanf("%ld", &n);   printf("Enter %ld integers\n", n);   for (c = 0; c < n; c++) scanf("%ld", &array[c]);   bubble_sort(array, n);   printf("Sorted list in ascending order:\n");   for (c = 0; c < n; c++) printf("%ld\n", array[c]);   return 0; }   void bubble_sort(long list[], long n) { long c, d, t;   for (c = 0 ; c < n - 1; c++) { for (d = 0 ; d < n - c - 1; d++) { if (list[d] > list[d+1]) { /* Swapping */   t = list[d]; list[d] = list[d+1]; list[d+1] = t; } } } }