Untitled

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.*;
class QuickSort {
    int partition(int intArray[], int low, int high) {
        int pi = intArray[high];
        int i = (low-1);
        for (int j=low; j<high; j++) {
            if (intArray[j] <= pi) {
                i++;
                int temp = intArray[i];
                intArray[i] = intArray[j];
                intArray[j] = temp;
            }
        }
        int temp = intArray[i+1];
        intArray[i+1] = intArray[high];
        intArray[high] = temp;

        return i+1;
    }


    void quick_sort(int intArray[], int low, int high) {
        if (low < high) {
            int pi = partition(intArray, low, high);
            quick_sort(intArray, low, pi-1);
            quick_sort(intArray, pi+1, high);
        }
    }
}

class Main{
    public static void main(String args[]) throws FileNotFoundException {
        File file = new File("In0101.txt");
        PrintWriter zapis = new PrintWriter("Out0101.txt");
        Scanner in = new Scanner(file);
        int intArray[] = {4,-1,6,8,0,5,-3};
        int n = intArray.length;
        

        zapis.println("Nieposortowane: " + Arrays.toString(intArray));
        QuickSort obj = new QuickSort();
        obj.quick_sort(intArray, 0, n-1);
        zapis.println("\nPosortowane: " + Arrays.toString(intArray));
        zapis.close();
    }
}