Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
50 lines (40 loc) · 829 Bytes

File metadata and controls

50 lines (40 loc) · 829 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
#include <bits/stdc++.h>
using namespace std;
bool isSorted(vector<int> v, int n) {
while (--n > 1) {
if (v[n] < v[n-1]) {
return false;
}
}
return true;
}
void shuffle(vector<int> v, int n) {
for (int i = 0; i < n; i++) {
swap(v[i], v[rand() % n]);
}
}
void bogosort(vector<int> v, int n) {
while(!isSorted(v, n))
shuffle(v, n);
}
void printarr(vector<int> v, int n) {
for (int i = 0; i < n; i++) {
cout << v[i] << ' ';
}
cout << endl;
}
int main()
{
cout << "Enter Size of the Array: ";
int n;
cin >> n;
std::vector<int> v(n);
cout << "Enter the elements of the Array: " ;
for (auto &i : v) {
cin >> i;
}
bogosort(v, n);
cout << "Sorted Array: " ;
printarr(v, n);
return 0;
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.