Code for BUBBLE Sort


1                                                     Bubble sort



Ø      
#include<stdio.h>
#include<conio.h>

void BubbleSort(int[] , int);

void main()
{
   int array[10], n, i;
   clrscr();
   printf("\n\n------------------------ BUBBLE SORT -----------------------");
   printf("\n\n ENTER NUMBER OF ELEMENTS : ");
   scanf("%d", &n);

   printf("\n");

   for (i = 0 ; i < n ; i++ )
   { printf("ENTER ELEMENT %d: ",i+1);
     scanf("%d", &array[i]);
   }

   BubbleSort(array,n);

   getch();
}

void BubbleSort(int array[], int n)
{
   int i,c,j,temp;
   for ( i = 0 ; i < ( n-1 ) ; i++ )
   {
      for ( j = 0 ; j < n-i-1 ; j++ )
      {
       if ( array[j] > array[j+1])
       {
                temp = array[j];
                array[j] = array[j+1];
                array[j+1] = temp;
       }
      }

      printf("\nPASS %d :",i+1);

   for ( c = 0 ; c < n ; c++ )
   {   printf(" %d ", array[c]);  }


   }
   printf("\n\n FINAL SORTED ELEMENTS : ");
   for ( i = 0 ; i < n ; i++ )
  {    printf(" %d ", array[i]); }
  getch(); 
}

OUTPUT:



Comments

Post a Comment

Popular posts from this blog

Code for Circular Linked List c-programing

#include<stdio.h> #include<conio.h> #include<stdlib.h> struct node {  int data;  struct node *next; }; struct node *head; void InsertAtBeginning(int x) {  struct node *temp = (struct node *)malloc(sizeof(struct node));  struct node *temp2 = head;  temp->data = x;  temp->next = NULL;  if(temp==NULL)  {   printf("\n MEMORY UNAVAILABLE");  }  if(head==NULL)  {   head = temp;   temp->next = head;  }  if(temp2->next!=head)  {   temp2 = temp2->next;  }  temp->next = head;  head = temp;  temp2->next = head; } void InsertAtEnd(int y) {  struct node *temp = (struct node *)malloc(sizeof(struct node));  struct node *temp2;  temp->data = y;  temp->next = NULL;  if(temp==NULL)  {   printf("\n MEMORY UNAVAILABLE");  }  if(head==NULL)  {   head = temp;   temp->next = head;  }  while(temp2->next!=head)  {   temp2 = temp2->next;  }  temp2->next = temp;  temp->n
Read more

Code for SELECTION Sort in C-Programming

Image
1                               Selection Sort Ø       #include<stdio.h> #include<conio.h> void SelectionSort(int[] , int); void main() {    int array[10], n, i;    clrscr();    printf("\n\n--------------------- SELECTION SORT --------------------");    printf("\n\n ENTER NUMBER OF ELEMENTS : ");    scanf("%d", &n);    printf("\n");    for (i = 0 ; i < n ; i++ )    { printf("ENTER ELEMENT %d : ",i+1);     scanf("%d", &array[i]);      }    SelectionSort(array,n);    getch(); } void SelectionSort(int array[], int n) {    int i,c,       j,temp;    for ( i = 0 ; i < ( n-1 ) ; i++ )    {       for ( j = i + 1 ; j < n ; j++ )       {            if ( array[i] > array[j])              {                 temp = array[i];                 array[i] = array[j];                 array[j] = temp;               }       }
Read more