-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy patha.cpp
56 lines (53 loc) · 1.09 KB
/
a.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
#include <bits/stdc++.h>
using namespace std;
int Bubblesort(vector<int> arr)
{
int n = arr.size();
int numberOfSwaps = 0;
for (int i = 1; i < n; i++)
{
int j = i;
while (j > 0)
{
if (arr[j] < arr[j - 1])
{
swap(arr[j], arr[j - 1]);
numberOfSwaps++;
}
j--;
}
}
return numberOfSwaps;
}
int BubblesortDesc(vector<int> arr)
{
int n = arr.size();
int numberOfSwaps = 0;
for (int i = 1; i < n; i++)
{
int j = i;
while (j > 0)
{
if (arr[j] > arr[j - 1])
{
swap(arr[j], arr[j - 1]);
numberOfSwaps++;
}
j--;
}
}
return numberOfSwaps;
}
int main()
{
int n;
cin >> n;
vector<int> array(n);
for (int i = 0; i < n; i++)
{
cin >> array[i];
}
int swapsRequiredAscending = Bubblesort(array);
int swapsRequiredDescending = BubblesortDesc(array);
cout << min(swapsRequiredDescending, swapsRequiredAscending);
}