forked from jainaman224/Algo_Ds_Notes
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Bubble_Sort.cpp
50 lines (43 loc) · 1.05 KB
/
Bubble_Sort.cpp
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 <iostream>
using namespace std;
// Function for bubble sort
void Bubble_Sort(int array[], int size)
{
int temp, flag;
// flag keeps track if any swap happened or not, if swap not happened then array is sorted and it will break out of the loop
// and will save time from running for loop unnecessarily
for (int i = 0; i < size - 1; i++)
{
flag = 0;
for (int j = 0; j < size - i - 1; j++)
{
// Do swapping
if (array[j] > array[j + 1])
{
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
flag++;
}
}
if (!flag)
break;
}
}
// Function to print elements of array
void Print_Array(int array[], int size)
{
for (int i = 0; i < size; i++)
cout << array[i] << " ";
cout << endl;
}
// Driver Function
int main()
{
int array[] = {2, 4, 3, 1, 6, 8, 4};
Bubble_Sort(array, 7);
Print_Array(array, 7);
return 0;
}
// Output
// 1 2 3 4 4 6 8