codevs 1545
如题就是一道排序水题
给大家介绍一种不一样的排序方法:猴子排序
安利一波dalao
codevs:1506
luogu: zc蒟蒻
#include <iostream>
#include <cstdio>
#include <ctime>
#include <cstdlib>
using namespace std;
const int MAXN = 100 + 5;
int n, A[MAXN];
int main()
{
srand((time(NULL)));
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &A[i]);
while (true)
{
int x = rand() % n + 1, y = rand() % n + 1;
swap(A[x], A[y]);
int ok = 1;
for (int i = 1; i < n; i++)
{
if (A[i] > A[i + 1]) ok = 0;
}
if (ok) break;
}
for (int i = 1; i <= n; i++) printf("%d\n", A[i]);
return 0;
}