ACM - Quick Sort (Basic algorithm) Describted by Java

Now today we start to train the basic algorithm.
Every algorithm will be as a module and be written by 4 - 5 times.
Today is Quick Sort in Java.

import java.io.*;

public class Main{
    static StreamTokenizer st = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
    static PrintWriter pw = new PrintWriter(System.out);
    static int q[];
    public static void main(String []args) throws Exception {
        st.nextToken();
        int n = (int)st.nval;
        q = new int[n];
        for (int i = 0; i < n; i++) {
            st.nextToken();
            q[i] = (int)st.nval;
        }
        quick_sort(q, 0, n - 1);
        for (int i = 0; i < n; i++) {
            pw.print(q[i] + " ");
            pw.flush();
        }
    }
    
    private static void quick_sort(int q[], int l, int r) {
        if (l >= r) return;
        
        int x = q[l], i = l - 1, j = r + 1;
        while(i < j){
            do i++; while(q[i] < x);
            do j--; while(q[j] > x);
            if (i < j) {
                int temp = q[i];
                q[i] = q[j];
                q[j] = temp;
            }
        }
        quick_sort(q, l, j);
        quick_sort(q, j + 1, r);
    }
    
}