-
Notifications
You must be signed in to change notification settings - Fork 0
/
Quick_Sort.cpp
77 lines (58 loc) · 1.38 KB
/
Quick_Sort.cpp
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
/******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <iostream>
using namespace std;
void swap(int arr[],int i,int j)
{
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
int partition(int arr[],int start, int end)
{
int pivot = arr[end];
int i = (start-1);
int j;
for (j = start; j < end; j++)
{
if(arr[j]<pivot)
{
i++;
swap(arr,i,j);
}
}
i++;
swap(arr,i,j);
return i;
}
void Quicksort(int arr[],int start, int end)
{
if (start<end)
{
int k = partition(arr,start,end);
Quicksort(arr,start,k-1);
Quicksort(arr,k+1,end);
}
}
int main()
{
int i,j,num,n;
cout<<"Enter the size of an array: ";
cin>>num;
int arr[num];
cout<<"Enter the elements for sorting: ";
for (i = 0; i < num; i++)
{
cin >> arr[i];
}
cout<<"After Sorting the elements: ";
Quicksort(arr,0,num-1);
for (i = 0; i < num; i++)
{
cout<<arr[i]<<" ";
}
return 0;
}