Skip to main content

BUBBLE SORT

/**
    Program Name: BUBBLE SORT

    Description: This Program sorts a Given Array in Ascending Order

    Author:  Tauqirul Haque
       
*/

#define SIZE 10

void bubbleSort(int data[SIZE]);
void displayElement(int data[SIZE]);

void main()
{
    int data[SIZE] = { 45,34,66,89,45,34,76,22,79, 12};
   
    printf("\nThe Original Array Before Sorting ... ");
    displayElement(data);
   
    printf("\nArray After Sorting ... ");
    bubbleSort(data);
    displayElement(data);
   
}

void displayElement(int data[SIZE])
{
    int i;
    for(i=0; i
    {
        printf("\nData[%d]  =  %d",i,data[i]);
    }
    printf("\n");
}

void bubbleSort(int data[SIZE])
{
    int i,j;
   
    for(i=0; i
    {
        for(j=0; j
        {
                       
            if(data[j] > data[j+1])   //swapping
            {
                int temp = data[j];
                data[j] = data[j+1];
                data[j+1] = temp;
            }
        }
    }
}
               
       
   

Comments

Popular posts from this blog

Singly Linked List

/**     Program Name: Singly Linked List     Description: This Program is for Implemeting Singly Linked List     Author:  Tauqirul Haque         */ struct Linklist {     int item;     struct Linklist *next; }; typedef struct Linklist node; void insertAtBeginning(node **); void createAppendNode(node **); void insertInMiddle(node **); void deleteNode(node **); void displayNode(node **); void countNode(node **);  void searchElement(node **); void reverse(node **); void main() {     node *head = NULL;     int choice = 0;     while(choice != 9)     {             printf("\n\t\t\t1. Add Node At The Beginning ");     printf("\n\t\t\t2. Insert Element in the Middle ");     printf("\n\t\t\t3. Append New Node "); ...

Selection Sort

/**     Program Name: Selection Sort     Description: This Program sort a given array elements, using Selection                    Sort Algorithm     Author:  Tauqirul Haque         */ #include <conio.h> #include <stdio.h> #define MAX 5 void selectionSort(int *, int ); void display(int *); void main() {     int array[MAX] = { 35,56,23,11,46 };         printf("\nThe Array Before Sortint .... \n");     display(array);         selectionSort(array,MAX);         printf("\n\nThe Array After Sorting .. \n");     display(array);     } void selectionSort(int *array, int array_size) {   int i, j;   int min, temp;   for (i = 0; i < ar...