Java 排序一个数组，append 它在另一个数组中

Question

I want to perform a linear search though a[] and append the result to b[]. Here is my code:

public class sorting {
    static int a[]={10,12,14,2,1,3};
    static int  b[]=new int[a.length];

public static void fn()
{
    for(int i=0;i<a.length;i++)
    {
        for(int j=1;j<a.length;j++)
        {
            if(a[i]>a[j]){
                 b[i]=a[j];
            }
        }
    }   
}

I am getting output as 333101. I expect {1,2,8,10,12,30}.

Even after finding 1 as minimum, loop continues and find 10>3 and replaces 1 with 3. How do I stop the loop when a minimum is found?

Answer 1

You never initialize b[0] if a[0] is the smallest value in a .

If you want to have a sorted Output in b you should probably to a compare including b in the if statement.

What would be the intended behaviour if some numbers are negative or multipe times in a ?

One possible approach similar to your code would be

public static void fn() {
    for (int i = 0; i < a.length; i++) {
        b[i] = Integer.MAX_VALUE; // initialize with large value
        for (int j = 0; j < a.length; j++) {
            // search for Minimum bigger than last value already in b
            if (b[i] > a[j] && (i == 0 || a[j] > b[i - 1])) {
                b[i] = a[j];
            }
        }
    }
}

Answer 2

Try this approach.

public class Main
{
  public static void main (String[]args)
  {
    int a[] = { 10, 12, 14, 2, 1, 3 }, c;
    int b[] = new int[a.length];
    b = a;
    for (int i = 0; i < b.length; i++)
    {
    for (int j = i + 1; j < b.length; j++)
      {
        if (b[i] > b[j])
          {
            c = b[i];
            b[i] = b[j];
            b[j] = c;
          }
      }
    }
    for (int j = 0; j < b.length; j++)
    {
        if (j == 0)
          {
            System.out.print ("{"+b[j]+",");
          }else if(j == b.length-1){
            System.out.print(b[j]+"}");
          }else{
            System.out.print(b[j]+",");
          }
    }
  }
}

output:{1,2,3,10,12,14}