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

SIMPLE QUEUE

/**     Program Name: SIMPLE QUEUE     Description: This program is for Implementing Simple QUEUE     Author:  Tauqirul Haque         */ #define SIZE 3 int front = -1; int rear = -1; int queue[SIZE]; void deleteElement(); void insertElement(); void displayElement(); void main() {     int ch;     while(ch !=4)     {         printf("\n\t\t1. Insert into queue..\n");         printf("\t\t2. Delete From Queue...\n");         printf("\t\t3. Diplay Queue...\n");         printf("\t\t4. Exit Program ...\n");                 printf("Enter Your Choice #  ");         scanf("%d",&ch);         ...

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 "); ...