Posts

Showing posts from December, 2017

Bubble sort using function

Image
#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];  ...

Bubble sort

Image
/* 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++ )    ...

Selection Sort Program

Image
#include <stdio.h> int main() {    int array[100], n, c, d, position, 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++ )    {       position = c;       for ( d = c + 1 ; d < n ; d++ )       {          if ( array[position] > array[d] )             position = d;       }       if ( position != c )       {          swap = array[c];          array[c] = array[position]; ...