zoukankan      html  css  js  c++  java
  • 插入排序

      public void insertSort(List<Integer> list)
      {
          if(list.size()<2)
              return;
          for(int i=1;i<list.size();i++)
          {
              int temp=list.get(i);
              int before=list.get(i-1);
              if(temp>before)
                  continue;
              for(int j=0;j<i;j++)
              {
                  if(list.get(j)>temp)
                  {
                      list.remove(i);
                      list.add(j, temp);
                      break;
                  }
              }
              
          }
      }
      
      @Test
      public void testInsertSort()
      {
          List<Integer> list=new ArrayList<Integer>();
          Random r=new Random();
          for(int i=0;i<15;i++)
          {
              list.add(r.nextInt(31));
          }
          System.out.println("before sort");
          System.out.println(list);
          insertSort(list);
          System.out.println(list);
      }
  • 相关阅读:
    ➡️➡️➡️IELTS reading by Simon on Bili
    lc0502
    lc0331
    lc0329
    lc0327
    lc0326
    lc0324
    lc0320
    lc0319
    lc0316
  • 原文地址:https://www.cnblogs.com/passer1991/p/2712241.html
Copyright © 2011-2022 走看看