算法分析实验

for(g=f+1;g<n;g++)
{
if(a[g]<a[min])
min=g;
}
temp=a[min];
a[min]=a[f];
a[f]=temp;
}
printf("\n选择排序后的数组为:");
for (f=0;f<n;f++)
printf ("%d ",a[f]);
*min = meter[e];
}
else{
if(meter[e] > *max)
*max = meter[e];
if(meter[s] < *min)
*min = meter[s];
}
return ;
}
{ // 随机数据填充数组
meter[i] = rand()%100;
if(!((i+1)%10)) // 输出表的随机数据
printf("%-6d\n",meter[i]);
else
printf("%-6d",meter[i]);
}
{
int i,j,val;
val = a[pro];
i = pro;
j = last;
while(i < j)
{
1.各种排序算法性能比较
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define n 10
void maopao(int a[]);
void xuanze(int a[]);
int main()
{ int m;
while (i < j &&a[j]>= val)
{
j--;
}
if (i < j)
{
a[i] = a[j];
i++;
if (max < stoe[i] + etos[i] - 1)
max = stoe[i] + etos[i] - 1;
printf ("输出出队人数%d\n", N-max);
// printf("输出最终形成的合唱队形%d",);
j--;
}
a[i] = val;
Quick_Sort (a,pro,i-1);
Quick_Sort (a,i+1,last);
}
}
}
}
stoe[i] = (max == -1) ? 1 : max;
}
etos[N-1] = 1;
for (i=N-2; i>=0; --i){
max = -1;
int max = INT_MIN; // 用最小值初始化
int min = INT_MAX; // 用最大值初始化
printf("随机数组为:\n");
srand(time(0)); // 初始化随机数发生器
for(i = 0; i < M; i ++)
int main (void){
int N, student[100];
int i, j;
int stoe[100], etos[100];
int tmp, max;
while (scanf ("%d", &N) != EOF){
printf ("%d ",a[m]);
}
printf ("\n");
start=clock();
maopao(a);
end=clock();
t1=((end-start)/CLOCKS_PER_SEC);
printf ("冒泡排序的时间为:");
printf("t1=%fs\n",t1);
printf ("\n");
}
2.分治法实现快排
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
void Quick_Sort (int a[],int pro,int last);
int main()
if (student[i] > student[j]){
tmp = stoe[j] + 1;
if (max < tmp)
max = tmp;
{
int i;
if(e-s <= 1)
{
// 获取局部解，并更新全局解
if(meter[s] > meter[e])
{
if(meter[s] > *max)
*max = meter[s];
if(meter[e] < *min)
{
int i,j,k;
for (j=0;j<=n-1;j++)
{
for (i=0;i<n-j-1;i++)
if (a[i]>a[i+1])
{
k=a[i];
a[i]=a[i+1];
a[i+1]=k;
} Biblioteka printf("\n冒泡排序后的数组为:");
for (j=N-1; j>i; --j){
if (student[i] > student[j]){
tmp = etos[j] + 1;
if (max < tmp)
for (i=0;i<n;i++)
{
printf ("%d ",a[i]);
}
printf ("\n");
}
void xuanze(int a[])
{
int temp,min;
int f,g;
for(f=0;f<n-1;f++)
{
min=f;
for (i=0; i<N; ++i)
scanf ("%d", &student[i]);
stoe[0] = 1;
for (i=1; i<N; ++i){
max = -1;
for (j=0; j<i; ++j){
}
while (i < j &&a[i]<val)
{
i++;
}
if (i < j)
{
a[j] = a[i];
3.分治法求最大值最小值
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <time.h>
#define M 10 // 分治法获取最优解
void PartionGet(int s,int e,int *meter,int *max,int *min)
{
int i = 0;
printf("请输入个数: ");
scanf("%d", n);
printf("请输入数组p :\n");
for (i = 0; i < (*n); i++)
{
scanf("%f", &p[i]);
}
printf("请输入数组w :\n");
for (i = 0; i < (*n); i++)
{
int data[10],i;
srand(time(NULL));
for (i=0;i<10;i++)
{
data[i] = rand()%100;
}
for (i=0;i<10;i++)
{
printf("%d ",data[i]);
}
printf("\n");
Quick_Sort (data,0,10);
for (i=0;i<10;i++)
{
printf("%d ",data[i]);
}
printf("\n");
}
void Quick_Sort (int a[],int pro,int last)
PartionGet(0,M - 1,meter,&max,&min); // 分治法获取最值
printf("\n最大值 : %d\n最小值: %d\n",max,min);
system("pause");
return 0;
}
4.合唱队形问题
#include <stdio.h>