Quick Sort Beginner Java

import java.io.*;
import java.io.File;
import java.util.Scanner; 
public class ss {
	public static void main(String[] args) throws IOException {
		System.out.print("Name of file with array: ");
		Scanner readIn = new Scanner(System.in);
		String input = readIn.nextLine();
		testScan1(input);
		
	} 
	public static void testScan1(String filename) {
		File file = new File(filename);
		Scanner scan;
		int[] array;
		try {
			array = new int[5];
			scan = new Scanner(file);
		} catch (java.io.FileNotFoundException e) {
			System.out.println("couldn't open. file not found ");
			return;
		}
		int i =0;
		while (scan.hasNext()) {
			//for (i = 0; i <= file.length(); ++i) 
				array[i] = Integer.parseInt(scan.next());
				i++;}
				quickSort(array, 0, array.length-1);
			partition(array, 0, array.length-1);
			
				//System.out.println(java.util.Arrays.toString(array));
				for (int j = 0; j < array.length; ++j)
				System.out.println(array[i] + " ");
			}
		
	 
	static int partition(int[] arr, int left, int right) {
		int i = left;
		int j = right;
		int tmp;
		int pivot = arr.length-1;
		while (i <= j) {
			while (arr[i] < pivot)
				i++;
			while (arr[j] > pivot)
				j--;
			if (i <= j) {
				tmp = arr[i];
				arr[i] = arr[j];
				arr[j] = tmp;
				i++;
				j--;
			}
		}
		return i;
	} 
	static void quickSort(int[] arr, int left, int right) {
		int index = partition(arr, left, right);
		if (left < (index - 1)); {
			
		}
		quickSort(arr, left, index - 1);
		if (index < right) {
			quickSort(arr, index, right); 
		}
	}		
	//for (int j = 0; j < array.length; ++j)
	//	System.out.println(array[i] + " ");
}