Question

import java.util.Arrays;

public class lab {
   public static void main(String args[])
   {
   int arr[] = {10, 7, 8, 9, 1, 5,6,7};
   int arr2[] = {9, 8, 7, 6, 5, 4, 3, 2, 1};
   int arr3[] = {1, 3, 5, 3, 2, 6, 20};
   quicksort(arr,0,arr.length-1);
   quicksort(arr2,0,arr2.length-1);
   quicksort(arr3,0,arr3.length-1);
   System.out.println(Arrays.toString(arr));
   System.out.println(Arrays.toString(arr2));
   System.out.println(Arrays.toString(arr3));
  
   }
   private static int partition(int[] items,int low, int high)
   {
   int i=0;
   int j=0;
   int k=high+1;
   int pivot=0;
   while(j < k)
   {
   if (items[j]    {
   swap(j,i,items);
   j++;
   i++;              
   }
   else if(items[j]==pivot)
   {
   j++;
   }
   else
   {
   swap(j,k-1,items);
   k--;
   }
   }
   return i;
   }

   private static void swap(int i,int j,int[] items)
   {
   int temp=items[i];
   items[i]=items[j];
   items[j]=temp;
   }
   public static void quicksort(int[] arr)
   {
   quicksort(arr,0,arr.length-1);
   }
   private static void quicksort(int[] arr, int low, int high)
   {
   if (low < high)
   {
   /* pi is partitioning index, arr[pi] is
   now at right place */
   int pi = partition(arr,low,high);

   // Recursively sort elements before
   // partition and after partition
   quicksort(arr, low, pi-1);
   quicksort(arr, pi+1, high);
   }
   }

}

This code has a stackoverflow error and I don't know what to do to fix it. If you could point out what's wrong and how to fix it, I would appreciate it,

Answer 1

Working fine now, Check and Let me know...PLEASE COMMENT

-------------------------------------------------------------------------------------------------------------------------------------------------------

import java.util.Arrays;

public class lab {

public static void main(String args[]) {

int arr[] = { 10, 7, 8, 9, 1, 5, 6, 7 };

int arr2[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1 };

int arr3[] = { 1, 3, 5, 3, 2, 6, 20 };

quicksort(arr, 0, arr.length - 1);

quicksort(arr2, 0, arr2.length - 1);

quicksort(arr3, 0, arr3.length - 1);

System.out.println(Arrays.toString(arr));

System.out.println(Arrays.toString(arr2));

System.out.println(Arrays.toString(arr3));

}

private static int partition(int[] items, int low, int high) {

int pivot = items[high];

int i = (low - 1);

int j = low;

while( j < high) {

if (items[j] <= pivot) {

i++;

int temp = items[i];

items[i] = items[j];

items[j] = temp;

}

j++;

}

swap(i+1, high, items);

return i + 1;

}

private static void swap(int i, int j, int[] items) {

int temp = items[i];

items[i] = items[j];

items[j] = temp;

}

public static void quicksort(int[] arr) {

quicksort(arr, 0, arr.length - 1);

}

private static void quicksort(int[] arr, int low, int high) {

if (low < high) {

/*

* pi is partitioning index, arr[pi] is now at right place

*/

int pi = partition(arr, low, high);

// Recursively sort elements before

// partition and after partition

quicksort(arr, low, pi - 1);

quicksort(arr, pi + 1, high);

}

}

}

----------------------------------------------------------------------------------------------------------------------------------------------------------
See Output


18 19 private static int partitionCint [items, int low, int high) 20 21 int pivot = items [high]; int i (low- 1); int j - low; whileC j < high)t <terminated> lab [Java Application] /Library/Java 01, 5, 6, 7, 7, 8, 9, 1ø] [1, 2, 3, 4, 5, 6, 7, 8, 9] [1, 2, 3, 3, 5, 6, 20] 23 24 25 26 27 28 29 30 31 32 if (items[j] <= pivot) { int tempitems[i]; items[i]itemsLj]; items[j]-temp; 34 35 36 37 38 39 private static void swapCint i, int j, int[] items) 40 41 42 43 swapCi+1, high, items); return i 1; int temp -items i] items [i]itemsLj]; items[j] -temp; 45 46 public static void quicksort(int arr)1\ quicksort(arr, 0, arr.length 1);

Thanks, PLEASE COMMENT if there is any concern.