forked from Dishakumra/Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
quicksort.java
63 lines (56 loc) · 1.17 KB
/
quicksort.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
import java.io.*;
import java.util.*;
class quicksort
{
;
void quicksorting(int arr[],int l,int h)
{
if(l<h)
{
int p=partition(arr,l,h);
quicksorting(arr,l,p-1);
quicksorting(arr,p+1,h);
}
}
int partition(int arr[],int l,int h)
{
int pivot = arr[h];
int i = (l-1); // index of smaller element
for (int j=l; j<h; j++)
{
// If current element is smaller than the pivot
if (arr[j] < pivot)
{
i++;
// swap arr[i] and arr[j]
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
// swap arr[i+1] and arr[high] (or pivot)
int temp = arr[i+1];
arr[i+1] = arr[h];
arr[h] = temp;
return i+1;
}
void swap(int arr[],int i,int j)
{
int temp;
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int len=sc.nextInt();
int arr[]=new int[len];
for(int i=0;i<len;i++)
arr[i]=sc.nextInt();
quicksort q=new quicksort();
q.quicksorting(arr,0,len-1);
for(int i=0;i<len;i++)
System.out.println(arr[i]+" ");
}
}