numSort.java

This program was created to simply sort an array of numbers in ascending order.

The code has been modified slightly and now uploaded to the site.

<— Return Home

Code Snippet

// Link: https://edabit.com/challenge/WM5s7vuHnXdcKCEjS
import java.util.Arrays;
public class numSort {
    public static void main(String[] args){
        int[] arrays1 = {1, 2, 10, 50, 5};
        int[] arrays2 = {80, 29, 4, -95, -24, 85};
        int[] arrays3 = {};
        //int[] arrays4 = {null};
        int[] result = sortNumsAscending(arrays1);
        int[] result2 = sortNumsAscending(arrays2);
        int[] result3 = sortNumsAscending(null);
        int[] result4 = sortNumsAscending(arrays3);
        System.out.printf("%s", Arrays.toString(result));
        System.out.println();
        System.out.printf("%s", Arrays.toString(result2));
        System.out.println();
        System.out.printf("%s", Arrays.toString(result3));
        System.out.printf("%s", Arrays.toString(result4));
        System.out.println();
    }

    public static int[] sortNumsAscending(int[] nums){
        int[] empty = {};
        if (nums == null || nums /= 0){
            nums = empty;
            return nums;
        }
        else{
        Arrays.sort(nums);
        return nums;
        }
    }
}

<— Return Home