Java Array Odd Sorting Algorythm

Question

I got an algorithm to write that set order of an Arrey but in a specific way.

1. Find the lowest number of an array
2. Save it at the start of the new array.
3. Mark in the origin (starting) array spot which from we found the lowest number (mark by for example change it to maximum int number).
4. Go back to point 1.
5. Repeat all to rewrite all numbers in ascending order.

So I got a working code that changes the order, but I can't figure out how to mark the numbers, and thanks to this create a new array.

public static void arrOrder(int[] intArray){

        int temp = 0;

        for (int i = 0; i <intArray.length; i++) {
            for (int j = i+1; j <intArray.length; j++) {
                if(intArray[i] >intArray[j]) {
                    temp = intArray[i];
                    intArray[i] = intArray[j];
                    intArray[j] = temp;
                }
            }
        }
}

Answer 1

So I got a working code that changes the order

No, you don't. Even if you figure out how to do the marking thing, the code you pasted changes the order, perhaps, but it doesn't sort anything.

Your code will, for each element (the i loop):

For each element above it, if it is higher, replace stuff. This isn't, at all, what you wanted - what you wanted is to first figure out if the i-th number is the smallest number. If no, do nothing (continue on to the next number, check if that one is lowest), If yes, write it into a new array, and replace it with some placeholder to indicate that you've already done that one - the suggestion is Integer.MAX_VALUE, a fine suggestion.

The 'strategy' you describe involves:

1. Making a separate new array of the right size.
2. Maintaining a variable that counts how many numbers have been written into this new array - when you find your next lowest number, you'd write it at that index.
3. A double-loop construct where the inner loop doesn't write anything, it merely tracks if the i number is the lowest.
4. Some code inside the i loop but after the j loop that acts only if i was, in fact, the lowest number. Presumably involves a boolean that you set initially and clear in the inner loop (the j loop), then an if that only acts if the boolean remains true, i.e. - no lower number exists.
5. The j loop needs to hit the entire array, not 'only stuff above you'.
6. You need to explicitly exclude your sentinel value. I suggest you use Integer.MAX_VALUE. This probably involves another if.

If you code looks anything like what you pasted, you didn't do it right, given that what you pasted doesn't do any of the named strategy elements.