-
Notifications
You must be signed in to change notification settings - Fork 73
/
Bubble_Sort.cpp
53 lines (42 loc) · 1.06 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
#include<iostream>
using namespace std ;
int bubble_sort(int arr[] , int n)
{
for(int i=1; i<n; i++)
{
bool swapped = false ;
for(int j=0; j<n-i; j++ )
{
if(arr[j] > arr[j+1])
{
swap(arr[j] , arr[j+1]) ;
swapped = true ;
}
}
if(swapped = false)
{
break ;
}
}
return arr[5] ;
}
int main()
{
int arr[50] = { 4,3,2,1 } ;
int size = 4 ;
bubble_sort(arr , size) ;
for(int i=0; i<4; i++)
{
cout<<arr[i]<<" " ;
}
return 0 ;
}
/* ******************************* ALGOTRITM ***************************************
(1) i number of round ko denote kae raha hai .
(2) j hone wale swaps ko denote kara .
(3) n-i us baat ko denote kar ki jese last wala right place per fix ho jayega ho jayega
to hum agale baar humko us index per ni jana hai .
(4) agar agala wala , bada hoga to he pichla wala swap karega .
(5) agar aik bhi swap ni ho re matlab array already sorted hai , to break maar denge taki
TIME COMPLEXITY accchi rahegi .
*/