-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBubbleSort.cpp
51 lines (44 loc) · 995 Bytes
/
BubbleSort.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
/*
link : https://practice.geeksforgeeks.org/problems/bubble-sort/1
Given an Integer N and a list arr. Sort the array using bubble sort algorithm.
Example 1:
Input:
N = 5
arr[] = {4, 1, 3, 9, 7}
Output:
1 3 4 7 9
*/
void bubbleSort(int arr[], int n)
{
// Your code here
for(int i=0;i<n-1;i++)
for(int j=0;j<n-i-1;j++)
{
if(arr[j]>arr[j+1])
{
swap(&arr[j],&arr[j+1]);
}
}
}
class Solution
{
public:
//Function to sort the array using bubble sort algorithm.
void bubbleSort(int arr[], int n)
{
// Your code here
bool swapped;
for(int i=0;i<n;i++)
{ swapped=false;
for(int j=0;j<n-i-1;j++)
{
if(arr[j]>arr[j+1]){
swap(&arr[j],&arr[j+1]);
swapped=true;
}
}
if(swap==false)
break;
}
}
};