Sample C Program With Algorithm To Implement Bubble Sort Using Pointers.

ALGOTITHM

STEP 1: Start the program.
STEP 2: Read the value of n.
STEP 3: Set for loop to read the elements of array for( i = 0; i < n; i++ ).
STEP 4: Call the function bubblesort ( a , n ).
STEP 5: Print the sorted array a.
STEP 6: Stop the program.


FUNCTION BUBBBLESORT ( int *b [], int n )

STEP 1: Declare the local variable.
STEP 2: Set a for loop for( i = 0; i < n; i++ )
STEP 3: Nest another for loop for( j = 1; j < n; j++ )
STEP 4: Check the condition b[i] > b[j]
STEP 5: If so swap the two values using temporary y variable t as
t = a[i]
b[i] = b[j]
b[j] = t
STEP 6: Else go back to step3.


SAMPLE PROGRAM:

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

void bubblesort( int *[], int);

void main()
{

int i, n, a[100];
clrscr();

printf( " \n Enter the number of elements: " );
scanf( " %d ", &n );

printf( " \n Enter the array elements " );
for( i = 0; i < n; i++)
scanf( " %d ", &a[i] );

printf( " \n UNSORTED ARRAY ELEMENTS " );

for(i = 0; i < n; i++ )
printf( " \t %d ", a[i] );

bubblesort( a, n );
printf( " \n SORTED ARRAY ");

for( i = 0; i < n; i++)
printf( " \t %d ", *(a + i) );

getch();

}


void bubblesort(int* b[],int n)
{

int i, j, t;
for( i = 0; i < n; i++ )
  {
  for( j = i + 1; j < n; j++ )
    {
      if( b[i] > b[j] )
      {
        t = b[i];
        b[i] = b[j];
        b[j] = t;
      }
    }
  }
}


OUTPUT:

Enter the number of elements: 6
Enter the array elements 34
32
12
456
43
56
UNSORTED ARRAY ELEMENTS 34 32 12 456 43 56
SORTED ARRAY 12 32 34 43 56 456


ALSO READ:

Sample C Program To Implement Recursive Algorithm Using Pointers.

Sample C Program To Implement Selection Sort Using Pointers, Arrays & Functions.

Sample C Program On Use Of Array & Pointer Concept Together.

Sample C Program On Pointers & 2 - Dimensional Array.

Sample C Program On Strings Into Array Of Pointers.

Sample C Program To Accept & Add Ten Numbers Using Pointers.