I need help increasing the stack/heap size of my JVM

Question

I am currently trying to run a recursive quick sort program to sort a reverse sorted array of 60,000. I realize this takes up a lot of memory and may not be the most efficient form of quick sort but I need to get some information from this program run. Everytime i try to run the program I get a stack overflow error. From what I have read on these forums this is due to an inadequate stack/heap. I have read that you just type a line of code in when you start up your JVM to increase the stack/heap but how exactly do you do this? Could someone give me a step by step process? I am new at this so the more details the better. Thanks!

Answer 1

public static void quickSort(int f, int l){
     if (f < l){
          int m = split(f,l);
          quickSort(f, m-1);
          quickSort(m+1, l);
public static int split(int f, int l){
     int x = a[f];
     int sp = f;
     for (int i=f+1; i<=l; i++){
          if(a[i] <= x){
             sp++;
             swap(i,sp);
     swap(f,sp);
     return sp;               
// A method to swap values of an array
public static void swap(int i, int j){
     int temp = a;
     a[i] = a [j];
     a[j] = temp;     
}Haven't really looked at the code, but basically you'd have a source of randomness (an instance of Random for example) and choose x like this instead:private static Random random = new Random();
public static int split(int f, int l){
     int x = a[random.nextInt(l-f) + f]; //but check for one-off errors here, I haven't checked this