-
Notifications
You must be signed in to change notification settings - Fork 0
/
Quick Sort_Java
57 lines (45 loc) · 1.11 KB
/
Quick Sort_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
# Quick Sort
public class QuickSort{
int partition(int arr[], int low, int high)
{
int pivot=high;
for (int i=0;i<pivot;i++)
{
if (arr[i]>arr[pivot])
{
int temp=arr[i];
arr[i]=arr[pivot-1];
arr[pivot-1]=arr[pivot];
arr[pivot]=temp;
pivot--;
i--;
//System.out.println(i+" "+pivot);
}
}
return pivot;
}
void sort(int arr[], int low, int high)
{
if(low<high)
{
int pivot=partition(arr,low,high);
//System.out.println(pivot);
sort(arr,low,pivot-1);
sort(arr,pivot+1,high);
}
}
void printArray(int arr[])
{
for(int i=0;i<arr.length;i++)
{
System.out.println(arr[i]);
}
}
public static void main(String []args){
QuickSort qs= new QuickSort();
int arr[]={10,80,30,90,40,50,70};
int len= arr.length;
qs.sort(arr,0,len-1);
qs.printArray(arr);
}
}