data_structures/bubble.cpp at master · sethupathib/data_structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <bits/stdc++.h>
using namespace std;

//bubble sort --> the largest element is pushed to the right most part of the array


void swap(int *A,int *B)
{
	int temp=0;
	temp = *A;
	*A=*B;
	*B = temp;
	}

void bubbleSort(int A[],int n)
{
for(int k=0;k<n-1;k++)
{
	int flag=0;
	for(int i=0;i<n-k-1;i++)
	{
		if (A[i]>A[i+1])
		{

			swap(&A[i],&A[i+1]);
			flag=1;
		}
		}
	//	cout<<"a";
		if (flag==0) break;
	}

	cout<<"Sorted Order is -->";
	for(int j=0;j<6;j++)
	{
		cout<<A[j]<<" ";
		}

}


int main()

{
	int A[] = {2,7,4,1,5,3};
	bubbleSort(A,6);

	return 0;
	}