Greg

package sort;import java.util.*;public class Main {    public static void main(String[] args)     {        Scanner inNumOfAsks = new Scanner(System.in);        Scanner scVals = new Scanner(System.in);        int numOfAsks;        int[] values;        values = new int[100];        System.out.printf("How many numbers need to be sorted?:");        numOfAsks = inNumOfAsks.nextInt();        for(int i = 1; i <= numOfAsks; i++)        {            System.out.printf("Value %d: ", i);            values[i] = scVals.nextInt();        }        boolean done = true;        //bsort        while(done)        {            done = false;            for(int k = 1; k <= numOfAsks; k++)            {                if(values[k] < values[k+1])                {                    int tmp = values[k];                    values[k] = values[k+1];                    values[k+1] = tmp;                    done = true;                }            }        }        for(int j = 1; j <= numOfAsks; j++)        {            System.out.printf("Val %d: %d\n",j, values[j]);        }        System.out.printf("Highest value: %d\n", values[1]);        System.out.printf("Lowest value: %d\n", values[numOfAsks]);    }}