C Programming Tutorial

C Sorting Algorithms - Bubble Sorting

#include <stdio.h>

void display(char*msg,int*a);
void bubble_sort(int* a);
int main(void)
{

        int a[10]={1,10,20,12,15,13,78,88,99,-1};

        display("before sorting...",a);
        bubble_sort(a);
        display("After sorting...",a);

        return 0;
}

void display(char*msg,int*a)
{
        printf("%s  ",msg);
 
       for(int i=0; i < 10; i++)
	{

                printf("%d ",a[i]);

        }

        printf("\n");

}

void bubble_sort(int* a){

        for(int i=0; i < 10; i++)
        {
                for(int j=0; j < 10; j++)
                {
                        if( a[i]<a[j])
			{
                                int t = a[i];
                                a[i]=a[j];
                                a[j]=t;

                        }

                }

        }
                                                                                                                                                      
	

before sorting...  1 10 20 12 15 13 78 88 99 -1 
After sorting...  -1 1 10 12 13 15 20 78 88 99 
	

Time and Space Complexity