-
Notifications
You must be signed in to change notification settings - Fork 121
/
Copy pathsort 0s,1s,2s array.cpp
75 lines (67 loc) · 1.16 KB
/
sort 0s,1s,2s array.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
#include<iostream>
#include<vector>
using namespace std;
void swap(int *px,int *py)
{
int temp=*px;
*px=*py;
*py=temp;
}
void input(vector<int>&arr)
{
cout<<"enter the elements in the array\n";
for(int i=0;i<arr.size();i++)
{
cin>>arr[i];
}
}
void sort(vector<int>&arr)
{
int n=arr.size();
int low=0;
int mid=0;
int high=n-1;
while(mid<=high)
{
switch(arr[mid])
{
case 0:
{
swap(&arr[mid],&arr[low]);
low++;
mid++;
break;
}
case 1:
{
mid++;
break;
}
case 2:
{
swap(&arr[high],&arr[mid]);
high--;
break;
}
}
}
}
void display(vector<int>&arr)
{
for(int i=0;i<arr.size();i++)
{
cout<<arr[i]<<" ";
}
cout<<endl;
}
int main()
{
int size;
cout<<"enter the size of array\n";
cin>>size;
vector<int>arr(size,0);
input(arr);
sort(arr);
display(arr);
return 0;
}