|
马上注册,结交更多好友,享用更多功能^_^
您需要 登录 才可以下载或查看,没有账号?立即注册
x
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int in_order(int array[], int length);
void shuffle(int array[], int length);
void bogo_sort(int array[], int length);
int in_order(int array[], int length)
{
int i = 0;
while (array[i] <= array[i+1] && ++i < length - 1)
;
if (i == length - 1)
{
return 1;
}
else
{
return 0;
}
}
void shuffle(int array[], int length)
{
int index, temp, i;
static int t1, t2;
srand(t1);
t1 = rand();
t2 = time(NULL);
srand(t1+t2);
for (i = 0; i < length; i++)
{
index = rand() % (length - i) + i;
if (index != i)
{
temp = array[i];
array[i] = array[index];
array[index] = temp;
}
}
}
void bogo_sort(int array[], int length)
{
while (!in_order(array, length))
{
shuffle(array, length);
}
}
int main(void)
{
int array[] = {73, 108, 111, 118, 101, 70, 105, 104, 67};
int i, length;
time_t begin, end;
begin = time(NULL);
length = sizeof(array) / sizeof(array[0]);
bogo_sort(array, length);
printf("排序后的结果是:");
for (i = 0; i < length; i++)
{
printf("%d ", array[i]);
}
putchar('\n');
end = time(NULL);
printf("总共耗时:%ld秒\n", end - begin);
return 0;
}
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
int in_order(int array[], int length);
void shuffle(int array[], int length);
void bogo_sort(int a[], int n);
int in_order(int array[], int length)//判断洗牌后的数组中数字是否顺序排列
{
int i = 0;
while(array[i] < array[i+1] && ++i < length -1)
;
if (i == length - 1)
{
return 1;
}
else
{
return 0;
}
}
void shuffle(int array[], int length)// 随机排序
{
int index, temp, i;
srand(time(NULL)); //rand(time(NULL)) 获得随机数的间隔是 1 秒 1 次
for (i = 0;i < length;i++)
{
index = rand() % (length - i) + i;
if (index != i)
{
temp = array[index];
array[index] = array[i];
array[i] = temp;
}
}
}
void bogo_sort(int array[], int length) //当与目标字符串一致时跳出循环
{
while (!in_order(array, length))
{
shuffle(array, length);
}
}
int main(void)
{
int array[] = {73, 108, 111, 118, 101, 70, 105, 104, 67};
int i, length;
time_t begin, end;
begin = time(NULL); //time:获取当前系统时间(UTC时间)的time_t值
length = sizeof(array) / sizeof(array[0]);
bogo_sort(array, length);
printf("排序后的结果是:");
for (i = 0; i < length; i++)
{
printf("%d ", array[i]);
}
putchar('\n');
end = time(NULL);
printf("总共耗时:%ld秒\n", end - begin);
return 0;
}
请问这两个程序在dev C++中运行,为什么运行时间会这么长,运行很久都得不出结果?
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
void swap(void *a, void *b) {
unsigned char *p = a;
unsigned char *q = b;
unsigned char tmp;
tmp = *p;
*p = *q;
*q = tmp;
}
void shuffle(void *x, int size_elem, int total_elem) {
int i = total_elem - 1;
for(i ; i >= 0; --i) {
int r = rand() % (i+1);
swap(x + r*size_elem, x + i*size_elem);
}
}
int main(int argc, char *argv[]) {
time_t begin, end;
begin = time(NULL);
srand((unsigned)time(NULL));
int l[] = {73, 108, 111, 118, 101, 70, 105, 104, 67};
int n;
n = sizeof(l)/sizeof(l[0]);
int isSort = 0;
int i;
while(!isSort) {
shuffle(l, sizeof(l[0]), n);
isSort = 1;
for(i = 0; i < n-1; i++) {
if (l[i] > l[i+1]){
isSort = 0;
break;
}
}
}
end = time(NULL);
for(int i=0; i<9; i++){
printf("%d ", l[i]);
}
printf("\n总共耗时:%ld秒\n", end - begin);
}
67 70 73 101 104 105 108 111 118
总共耗时:0秒
|
-
-
|