forked from jainaman224/Algo_Ds_Notes
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Bubble_Sort.cpp
67 lines (60 loc) · 1.28 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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#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 num;
cout<<"Enter number of elements in your array: ";
cin>>num;
int array[num];
cou<<"Enter your array: ";
for (int i = 0; i < num; i++)
{
cin>>array[i];
}
Bubble_Sort(array, num);
Print_Array(array, num);
return 0;
}
/*INPUT:
Enter number of elements in your array: 7
Enter your array: 8
4
7
2
9
2
4
Output:
2 2 4 4 7 8 9*/