Scribd
Upload
120 views2 pages

Quick Sort Algorithm in Java Code

Quicksort is implemented in Java by recursively sorting subarrays of an array. The algorithm selects a pivot element and partitions the array around it such that all elements less than the pivot come before all elements greater than it. The subarrays are then recursively sorted until the entire array is in order. The code takes in an integer array, calls the quicksort method with the array and indices of the first and last elements, and prints the array before and after sorting.

Uploaded by

DrKrishna Priya Chakireddy
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
120 views2 pages

Quick Sort Algorithm in Java Code

Quicksort is implemented in Java by recursively sorting subarrays of an array. The algorithm selects a pivot element and partitions the array around it such that all elements less than the pivot come before all elements greater than it. The subarrays are then recursively sorted until the entire array is in order. The code takes in an integer array, calls the quicksort method with the array and indices of the first and last elements, and prints the array before and after sorting.

Uploaded by

DrKrishna Priya Chakireddy
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

[Link] to implement Quick Sort? import [Link].

*; class QuickSort1 { public static void qsort(int a[],int l ,int r) { if(l>=r) return; int i=l,j=r+1; int key =a[l]; while(i<j) { do { i++; }while(a[i]<key); do { j--; }while(a[j]>key); if(i>=j) break; int temp ; temp=a[i]; a[i]=a[j]; a[j]=temp; } a[l]=a[j]; a[j]=key; qsort(a,l,j-1); qsort(a,j+1,r); } static void print(int a[]) { for(int i=0;i<[Link];i++) [Link](a[i]); } public static void main(String args[]) throws Exception { DataInputStream in =new DataInputStream([Link]); int ar[]=new int[10]; int len=[Link]; [Link]("enter elements into the array "); for(int i=0;i<[Link];i++) ar[i]=[Link]([Link]());

[Link]("Array elements before sorting "); print(ar); qsort(ar,0,len-1); [Link]("Array elements After sorting "); print(ar); } }

You might also like