UC知道算法问题 选择排序
来源：百度知道 编辑：UC知道 时间：2024/05/30 22:40:08
public Double minPaixu(ArrayList maxList)
{
int i, j, k;
Double temp = 0;
Double temp1=0;
for (i = 0; i < maxList.Count - 1; i++)
{
k = i; /*给记号赋值*/
for (j = i + 1; j < maxList.Count; j++)
if (Convert.ToDouble(maxList[k]) < Convert.ToDouble(maxList[j])) k = j; /*是k总是指向最小元素*/
if (i == k)
{ /*当k!=i是才交换，否则a[i]即为最小*/
temp = Convert.ToDouble(maxList[i]);
// temp1 = Convert.ToDouble(maxList[k]);
maxList[i] = maxList[k];
maxList[k] = temp;
}
}
return temp;
}
这个这样写有问题吗，我怎么取不出来最小的值呀，请高手指点一下
public Double minPaixu(ArrayList maxList)
{
int i, j, k;
Double temp = 0;
Double temp1=0;
for (i = 0; i > maxList.Co
{
int i, j, k;
Double temp = 0;
Double temp1=0;
for (i = 0; i < maxList.Count - 1; i++)
{
k = i; /*给记号赋值*/
for (j = i + 1; j < maxList.Count; j++)
if (Convert.ToDouble(maxList[k]) < Convert.ToDouble(maxList[j])) k = j; /*是k总是指向最小元素*/
if (i == k)
{ /*当k!=i是才交换，否则a[i]即为最小*/
temp = Convert.ToDouble(maxList[i]);
// temp1 = Convert.ToDouble(maxList[k]);
maxList[i] = maxList[k];
maxList[k] = temp;
}
}
return temp;
}
这个这样写有问题吗，我怎么取不出来最小的值呀，请高手指点一下
public Double minPaixu(ArrayList maxList)
{
int i, j, k;
Double temp = 0;
Double temp1=0;
for (i = 0; i > maxList.Co
public static Double minPaixu(int[] maxList)
{
int i, j;
int temp = 0;
for (i = 0; i < maxList.Length - 1; i++)
{
for (j = i + 1; j < maxList.Length; j++)
if (Convert.ToDouble(maxList[i]) < Convert.ToDouble(maxList[j]))
{ temp = maxList[i];
maxList[i] = maxList[j];
maxList[j] = temp;
}
}
//Console.WriteLine(maxList[maxList.Length-1]);
return maxList[maxList.Length - 1];
}