This document presents information on bubble sorting, including: 1) An introduction to sorting and bubble sort, explaining that bubble sort involves repeatedly comparing adjacent elements and swapping them if they are in the wrong order. 2) An example showing the steps of bubble sorting an array from an initial unsorted state to a final sorted state. 3) The bubble sort algorithm presented in pseudocode, showing the logic of comparing adjacent elements and swapping if out of order over multiple passes through the array. 4) A C program implementing bubble sort on an integer array, taking user input for the array size and elements, performing the sorting logic, and outputting the sorted array.

1. PRESENTATION
On
Bubble sorting
Submitted to-
Ms. Apurva Gautam
Dept. of Computer Science
Submitted By-
Ayush Pandey
B.C.A. II sem.

2. WELCOME

3. Contents
● Introduction to Sorting
● Introduction to Bubble Sort
● Example of Bubble Sort
● Algorithm of Bubble sort
● Program of Bubble sort

4. Introduction
Sorting- Sorting takes an unordered
collection and makes it an ordered one.
1 2 3 4 5
1 2 3 4 5
5 7 2 1 4
1 2 4 5 7

5. Introduction
Bubble sort- The Algorithm is Bubble Sort
involves two steps over and over until the
data sorted.
1 Compare Adjacent two element if
necessary swap them.

6. Algorithm of Bubble Sort
1.Initialisation
Set I=0
2. repeat step 3 to 5 until I<M
3. J=0
4.repeat step 5 until J < N – I -1
5. If A[J] > A[J+1] then
step temp=A[J]

7. Set A[J]=A[J+1]
set A[J+1]= temp
end if
6. exit

8. Example
5 7 2 1 4
5 2 7 1 4
1 2 3 4 5

9. 5 2 1 7 45 2 1 7 4
5 2 1 4 7

10. 2
2 5 1 4 72
2 1 5 4 7

11. Example
● 3
2 5 4 71
1 2 4 5 7

12. Program of Bubble Sort
#include<stdio.h>
#include<conio.h>
void main()
{int arr[20],i,j,k,n;
printf(“Enter the size of array”);
scanf(“%d”,&n);
printf(“Enter the element of array”);
for(i=0;i<n;i++)
{scanf(“%d”,&arr[i]):
}
for(i=0;I<n;ioi++)
{for(j=i+1;j<n;j++)
{if(arr[i]>arr[j])
●
{
arr[i]=k;
arr[i]=arr[j];
arr[j]=k;
}}}
printf(“New array is”);
●
Print
●
getch();
●
}

13. THANK YOU