数组选择排序2

中心思想: 在一组数组中找到最值,然后在找到这个元素的索引值,用这个索引值中的元素与首元素进行互换

 

               class    HomeWoek3   {

 

                            public static void main(String[] arg)

                                {

                                             int[] number = {7,6,28,1,9,19};  //  创建一个数组

                                             for(int i = 0; i < number,length - 1; i++)  //  外循环,循环的是每一个元素

                                                        {

                                                                   int minIndex = i;  //  定义一个变量来赋值最小值 的索引值

                                                                   for(int j = i + 1;j <  number,length;i++ )  //  循环的是比较次数

                                                                          {

                                                                                    if(number[minIndex] > nunber[ j ])

                                                                                           {

                                                                                                     minIndex = j;

                                                                                           }

                                                                           }

                                                                                      if(number[minIndex] != number[i] )

                                                                                            {

                                                                                                       int temp = number[minIndex];

                                                                                                       number[minIndex] = number[ i ];

                                                                                                        number[ i ] = temp;

                                                                                            }

                                                            }

                                                                               for(int value : number)

                                                                                             {

                                                                                                          System.out.println(value);

                                                                                             }

              }

   }

                                   

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值