-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsort012.cpp
62 lines (55 loc) · 1.22 KB
/
sort012.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
// C program to sort an array with 0,1 and 2
// in a single pass
#include<stdio.h>
using namespace std;
/* Function to swap *a and *b */
void swap(int *a, int *b);
// Sort the input array, the array is assumed to
// have values in {0, 1, 2}
void sort012(int a[], int arr_size)
{
int l=0;
int h=arr_size-1;
int mid =0;
while(mid<=h)
{
switch(a[mid])
{
case 0 : swap(&a[l],&a[mid]);
l++;
mid++;
break;
case 1 : mid++;
break;
case 2 : swap(&a[mid],&a[h]);
h--;
break;
}
}
}
/* UTILITY FUNCTIONS */
void swap(int *a, int *b)
{
int temp = *a;
*a = *b;
*b = temp;
}
/* Utility function to print array arr[] */
void printArray(int arr[], int arr_size)
{
int i;
for (i = 0; i < arr_size; i++)
printf("%d ", arr[i]);
printf("\n");
}
/* driver program to test */
int main()
{
int arr[] = {0, 1, 1, 0, 1, 2, 1, 2, 0, 0, 0, 1};
int arr_size = sizeof(arr)/sizeof(arr[0]);
int i;
sort012(arr, arr_size);
printf("array after segregation ");
printArray(arr, arr_size);
return 0;
}