public class quickSort
{
    public static void main(String[] args)
    {
		void quickSortInner(int [] v. int i, int j)
		{
			if (v.length == 0) 
				{ return;	// array is empty
			else if (i == j)
				{ return v;	// returns value if array is of lenght 1
			else
				{ int pivot = v(i);
				i=i+1;
				while (i < j)
				{
					if (v(i) < pivot)
					{
					i=i+1;
					}
					else