ArrayIndexOutOfBoundsException help

Question

I dont' know why I'm getting this error msg.
java.lang.ArrayIndexOutOfBoundsException: 10000
     at basicquickSort.findPartition(basicquickSort.java:43)
     at basicquickSort.sort(basicquickSort.java:16)
     at SortTester.main(SortTester.java:28)
Exception in thread "main"
here is my code...
import java.util.*;
* <p>Title: basicquickSort </p>
* @author Ennio Bozzetti
* @version 1.0
public class SortTester {
  public static void main(String[] args) {
    //Creat a random array
    int SIZE = 10000;
    Integer randomArray[] = new Integer[SIZE];
    int mrv = (int)(Math.random()*99);
    for(int i = 0; i < SIZE; i++){
      randomArray[i] = new Integer(mrv);
      mrv = (int)(Math.random()*99);
    System.out.println("Sort Tester");
    System.out.println();
    //Basic Quick SOrt
    System.out.println();
    final long start = System.currentTimeMillis();
    basicquickSort.sort(randomArray, 0, 9999);
    final long stop = System.currentTimeMillis();
    System.out.println("Time test, basic quicksort: ");
    System.out.println(stop-start + "msec");
    System.out.println();
* <p>Title: basicquickSort </p>
* @author Ennio Bozzetti
* @version 1.0
public class basicquickSort {
  public static void sort (Comparable[] data, int min, int max){
    int indexOfPartition;
    if(max - min > 0){
      //Creat partitions
      indexOfPartition = findPartition (data, min, max);
      //Sort the left side
      sort(data, min, indexOfPartition -1);
      //Sort the right side
      sort(data, indexOfPartition +1, max);
  public static int findPartition(Comparable[] data, int min, int max){
    int left, right;
    Comparable temp, partitionelement;
    //Use the first element as the partition element
    partitionelement = data[min];
    left = min;
    right = max;
    while(left < right){
      //Search for an element that is > the partition element
      while(data[left].compareTo(partitionelement) <= 0 && left < right)
        left++;
      //Search for an element that is < the partition element
      while(data[right].compareTo(partitionelement) > 0)
        right++;
      //Swap the elements
      if(left < right){
        temp = data[left];
        data[left] = data[right];
        data[right] = temp;
    //move partition element to partition index
    temp = data[min];
    data[min] = data[right];
    data[right] = temp;
    return right;
}

Answer 1

I think that the problem is in findPartition, you return rigth wich can contain 9999 and you after add +1 so it will be 10000 then the exception will be thrown
hope this will help!