-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path20Sorting.cpp
69 lines (64 loc) · 1.79 KB
/
20Sorting.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
68
69
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);
int main()
{
string n_temp;
getline(cin, n_temp);
int n = stoi(ltrim(rtrim(n_temp)));
string a_temp_temp;
getline(cin, a_temp_temp);
vector<string> a_temp = split(rtrim(a_temp_temp));
vector<int> a(n);
for (int i = 0; i < n; i++) {
int a_item = stoi(a_temp[i]);
a[i] = a_item;
}
// Write your code here
int numberOfSwaps = 0;
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < a.size() - 1; j++) {
if (a[j] > a[j + 1]) {
int tmp {a[j]};
a[j] = a[j + 1];
a[j + 1] = tmp;
numberOfSwaps++;
}
}
if (numberOfSwaps == 0)
break;
}
cout << "Array is sorted in " << numberOfSwaps << " swaps.\n";
cout << "First Element: " << a.front() << '\n';
cout << "Last Element: " << a.back() << '\n';
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}
vector<string> split(const string &str) {
vector<string> tokens;
string::size_type start = 0;
string::size_type end = 0;
while ((end = str.find(" ", start)) != string::npos) {
tokens.push_back(str.substr(start, end - start));
start = end + 1;
}
tokens.push_back(str.substr(start));
return tokens;
}