Comments by Shuvradip Sarma (Top 1 by date)

output - 3,1,2,2,2

the full code is-

import java.util.*;
class quick_sort_algo
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("enter the length of the array");
int n=sc.nextInt();
int array[]=new int[n];
System.out.println("enter element in the array");
for(int i=0;i<array.length;i++)
{
="" array[i]="sc.nextInt();
" }
="" system.out.println("array="" before="" sorting");
="" for(int="" i="0;i<array.length;i++)
" system.out.print(array[i]+"="" ");
="" system.out.println();
="" int="" start="0;
" end="array.length-1;
" quick_sort_algo="" call="new" quick_sort_algo();
="" call.quick_sort(array,start,end);
="" after="" public="" static="" void="" swap(int="" array[],int="" i,int="" j)
="" t="array[i];
" array[j]="t;
" partition(int="" start,int="" end)
="" pivot_index="(start+end)/2;
" pivot="array[pivot_index];
" j="end;
" while(i<j)
="" while(array[i]<pivot)
="" i++;
="" while(="">pivot)
{
j--;
}
if(i