The document describes the bubble sort algorithm. It takes an array of numbers as input, such as {1,3,5,2,4,6}, and sorts it in ascending order through multiple passes where adjacent elements are compared and swapped if in the wrong order, resulting in the sorted array {1,2,3,4,5,6}. The algorithm works by making multiple passes through the array, swapping adjacent elements that are out of order on each pass until the array is fully sorted.

1. Bubble
sort

2. Bubble sort
This is a simple sorting algorithm.
The Input to this algorithm will be like this
Enter how many numbers you want to sort
in
Increasing order: 6
Enter the numbers to be sorted:
1,3,5,2,4,6

3. The output of this algorithm will be like this:
The result after sorting your numbers in
increasing order is:
1,2,3,4,5,6

4. The array of data to be sorted is
1,3,5,2,4,6 (in increasing order)
The process of “Bubble sorting”
1 < 3 no swapping
1 3 5 2 4 61 3

5. The array of data to be sorted is
1,3,5,2,4,6
The process of “Bubble sorting”
3<5 no swapping
1 2 4 63 5

6. The array of data to be sorted is
1,3,5,2,4,6
The process of “Bubble sorting”
5 > 2 swapping
1 3 4 65 22 5

7. The array of data to be sorted is
1,3,5,2,4,6
The process of “Bubble sorting”
5 > 4 swapping
1 3 2 65 44 5

8. The array of data to be sorted is
1,3,5,2,4,6
The process of “Bubble sorting”
5 < 6 no swapping
1 3 2 4 5 6

9. The array of data to be sorted is
1,3,5,2,4,6
The process of “Bubble sorting”
2nd pass 1 < 3 no swapping
2 4 5 61 3

10. The array of data to be sorted is
1,3,5,2,4,6
The process of “Bubble sorting”
2nd pass 3 > 2 swapping
1 4 5 63 22 3

11. The array of data to be sorted is
1,3,5,2,4,6
The process of “Bubble sorting”
2nd pass 3 < 4 no swapping
1 2 3 4 5 6

12. The array of data to be sorted is
1,3,5,2,4,6
The process of “Bubble sorting”
3rd pass 1 < 2 no swapping
3 4 5 61 2

13. The array of data to be sorted is
1,3,5,2,4,6
The process of “Bubble sorting”
The result after “Bubble sorting” is
1 2 3 4 5 6

14. ALGORITHM:
Bubble sort ( array, n)
{ n is the number of elements
for ( i = 1 to n-1 ) to be sorted
{
flag = 0 ; if i = 1 then j = i + 1 = 2
for ( j = i + 1 ; j <= n ; j++ )
{ if ( array ( i ) > array ( j ) ) if first num > second num
{ Swap( array ( i ) , array ( j ) ) ;
flag = 1 ;
} the value which is in i will be assigned to j
} the value which is in j will be assigned to i
}
}