2、在一组随机排列的数中找出第二小的,这个问题比上一个稍复杂,你能不能想出Θ(n)的算法?
注:转载请注明源地址:http://blog.csdn.net/whorus1/article/list/2,谢谢!
#include<stdio.h>
#define LEN 7
int a[LEN] = {4, 2, 3, 7, 9, 1, 5};
int min = 100;
int i, p;
int min_()
{
for (i = 0; i < LEN; i++)
{
if (a[i] < min)
{
min = a[i];
p = i;
}
}
return p;
}
int sec()
{
int N = LEN - 1;
int b[N];
int min = 100;
for (i = 0; i < p; i++)
{
b[i] = a[i];
}
for (i = p; i < N; i++)
{
b[i] = a[i + 1];
}
for (i = 0; i < N; i++)
{
if (b[i] < min)
{
min = b[i];
p = i;
}
}
printf ("%d %d\n",min,p);
}
int main()
{
min_();
sec();
return 0;
}