static int[] quik, insertion, selection, bubble;
    //sorting times and loop counts
    static long timeQ = 0, timeI = 0, timeS = 0, timeB = 0;
    static int loopQ = 0, loopI = 0, loopS = 0, loopB = 0;
    @Action
    public void sort() {
        //initializing the loop counters
        loopQ = 0;
        loopS = 0;
        loopI = 0;
        loopB = 0;
        //the radio button that you press makes you initialize the arrays to
        //the value selected
        if (radio10.isSelected()) {
            quik = new int[10];
            insertion = new int[10];
            selection = new int[10];
            bubble = new int[10];
        } else if (radio100.isSelected()) {
            quik = new int[100];
            insertion = new int[100];
            selection = new int[100];
            bubble = new int[100];
        } else if (radio1000.isSelected()) {
            quik = new int[1000];
            insertion = new int[1000];
            selection = new int[1000];
            bubble = new int[1000];
        } else {
            quik = new int[5000];
            insertion = new int[5000];
            selection = new int[5000];
            bubble = new int[5000];
        }
        //calls the method that fills arrays with the random numbers
        randomNum();
        //calls method that prints the array unsorted
        printArrayOrig();
        //calls sort methods according to if it is
        //ascending or descending
        if (radioAsc.isSelected()) {
            insertionAsc();
            long currentTime = System.currentTimeMillis();
            quikAsc(0, quik.length - 1);
            long finishTime = System.currentTimeMillis();
            timeQ = finishTime - currentTime;
            selectionAsc();
            bubbleAsc();
        } else {
            insertionDes();
            long currentTime = System.currentTimeMillis();
            quikDes(0, quik.length - 1);
            long finishTime = System.currentTimeMillis();
            timeQ = finishTime - currentTime;
            selectionDes();
            bubbleDes();
        }
        //prints sorted array
        printArraySorted();
        //prints time and loops
        printTime();
    }

    public void printTime() {
        //making a new string with the times and loops
        String phrase = "Selection Sort:\nNumber of times a loop was executed: " + loopS
                + "\nNumber of Milliseconds to complete sort: " + timeS
                + "\nBubble Sort:\nNumber of times a loop was executed: " + loopB
                + "\nNumber of Milliseconds to complete sort: " + timeB
                + "\nInsertion Sort:\nNumber of times a loop was executed: " + loopI
                + "\nNumber of Milliseconds to complete sort: " + timeI
                + "\nQuik Sort:\nNumber of times a loop was executed: " + loopQ
                + "\nNumber of Milliseconds to complete sort: " + timeQ;
        //printing phrase to the text area
        txtArea.setText(phrase);
    }
//prints a sorted array

    public void printArraySorted() {
        String phrase = "";
        for (int i = 0; i < selection.length; ++i) {
            phrase += i + " : " + selection[i] + "\n";
        }
        txtSort.setText(phrase);

    }
//prints the original unsorted array

    public void printArrayOrig() {
        String phrase = "";
        for (int i = 0; i < selection.length; ++i) {
            phrase += i + " : " + selection[i] + "\n";
        }
        txtOrig.setText(phrase);
    }
//quik sort ascending
//divides a large list into two smaller sub-lists
//the low elements and the high elements, then recursively sort the sub-lists

    public void quikAsc(int low, int high) {
        if (low >= high) {
            return;
        }
        int i = low;
        int j = high;
        int pivot = quik[(low + high) / 2];
        while (i < j) {
            while (quik[i] > pivot) {
                loopQ++;
                i++;
            }
            while (pivot > quik[j]) {
                loopQ++;
                j--;
            }
            if (i <= j) {
                int temp = quik[i];
                quik[i] = quik[j];
                quik[j] = temp;
                i++;
                j--;
            }
        }
        quikAsc(low, j);
        quikAsc(i, high);

    }
//quik sort descending
//divides a large list into two smaller sub-lists
//the low elements and the high elements, then recursively sort the sub-lists

    public void quikDes(int low, int high) {
        if (low >= high) {
            return;
        }
        int i = low;
        int j = high;
        int pivot = quik[(low + high) / 2];
        while (i < j) {
            while (quik[i] < pivot) {
                loopQ++;
                i++;
            }
            while (pivot < quik[j]) {
                loopQ++;
                j--;
            }
            if (i <= j) {
                int temp = quik[i];
                quik[i] = quik[j];
                quik[j] = temp;
                i++;
                j--;
            }
        }
        quikDes(low, j);
        quikDes(i, high);

    }
//insertion sort descending
    //Every repetition of insertion sort removes an element
    //from the input data, inserting it into the correct position in the already-sorted list

    public void insertionDes() {
        long currentTime = System.currentTimeMillis();
        for (int i = 1; i < 100; i++) {
            int j = i;
            int a = insertion[i];
            while ((j > 0) && (insertion[j - 1] < a)) {
                loopI++;
                insertion[j] = insertion[j - 1];
                j--;
            }
            insertion[j] = a;
        }
        long finishTime = System.currentTimeMillis();
        timeI = finishTime - currentTime;
    }
//insertion sort ascending
    //Every repetition of insertion sort removes an element
    //from the input data, inserting it into the correct position in the already-sorted list

    public void insertionAsc() {
        long currentTime = System.currentTimeMillis();
        for (int i = 1; i < insertion.length; i++) {
            int j = i;
            int a = insertion[i];
            while ((j > 0) && (insertion[j - 1] > a)) {
                loopI++;
                insertion[j] = insertion[j - 1];
                j--;
            }
            insertion[j] = a;
        }
        long finishTime = System.currentTimeMillis();
        timeI = finishTime - currentTime;
    }
//selection sort ascending
//checks for the minimum then puts it at the beginning of the array
    //then adding 1 to the index of where it put the smallest value

    public void selectionAsc() {
        long currentTime = System.currentTimeMillis();
        for (int i = 0; i < selection.length - 1; i++) {
            for (int j = i + 1; j < selection.length; j++) {
                loopS++;
                if (selection[i] > selection[j]) {
                    int temp = selection[i];
                    selection[i] = selection[j];
                    selection[j] = temp;
                }
            }
        }
        long finishTime = System.currentTimeMillis();
        timeS = finishTime - currentTime;
    }
//selection sort descending
//checks for the minimum then puts it at the end of the array
    //then subtracting 1 to the index of where it put the smallest value

    public void selectionDes() {
        long currentTime = System.currentTimeMillis();
        for (int i = 0; i < selection.length - 1; i++) {
            for (int j = i + 1; j < selection.length; j++) {
                loopS++;
                if (selection[i] < selection[j]) {
                    int temp = selection[i];
                    selection[i] = selection[j];
                    selection[j] = temp;
                }
            }
        }
        long finishTime = System.currentTimeMillis();
        timeS = finishTime - currentTime;
    }
//bubble sort ascending
    //bubbles biggest numbers to the bottom of the array

    public void bubbleAsc() {
        long currentTime = System.currentTimeMillis();
        boolean doMore = true;
        int button = bubble.length - 1;
        while (doMore) {
            doMore = false;
            for (int i = 0; i < button; i++) {
                loopB++;
                if (bubble[i] > bubble[i + 1]) {
                    int temp = bubble[i];
                    bubble[i] = bubble[i + 1];
                    bubble[i + 1] = temp;
                    doMore = true;
                }
            }
            button--;
        }
        long finishTime = System.currentTimeMillis();
        timeB = finishTime - currentTime;
    }
//bubble sort descending
    //bubbles largest numbers to the top of the array
    //compares if bigger, if not stays

    public void bubbleDes() {
        long currentTime = System.currentTimeMillis();
        boolean doMore = true;
        while (doMore) {
            doMore = false;
            for (int i = 0; i < bubble.length - 1; i++) {
                loopB++;
                if (bubble[i] > bubble[i + 1]) {
                    int temp = bubble[i];
                    bubble[i] = bubble[i + 1];
                    bubble[i + 1] = temp;
                    doMore = true;
                }

            }
        }
        long finishTime = System.currentTimeMillis();
        timeS = finishTime - currentTime;
    }

    public void randomNum() {
        int ranNum = 0;
        for (int i = 0; i < quik.length; ++i) {
            ranNum = (int) (Math.random() * 20000) - 10000;
            quik[i] = ranNum;
            insertion[i] = ranNum;
            selection[i] = ranNum;
            bubble[i] = ranNum;
        }
    }

Comparator getComparator() {
    switch (radioButtonField.getSelected().getValue()) {
        switch "desc":
            return Collections.reverseOrder();
        switch "asc":
        default:
            return ...;
    }
}

void quickSortButton_Click() {
    quickSort(list, getComparator());
}

void quickSort(List<Object> list, Comparator comparator) {
   
}