-
Notifications
You must be signed in to change notification settings - Fork 31
/
Copy pathcode_2.cpp
48 lines (43 loc) · 884 Bytes
/
code_2.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
//
// code_2.cpp
// Algorithm
//
// Created by Mohd Shoaib Rayeen on 23/11/18.
// Copyright © 2018 Shoaib Rayeen. All rights reserved.
//
#include <iostream>
using namespace std;
void segregate0and1(int arr[], int n) {
int first = 0;
int second = n - 1;
while(first < second) {
if(arr[first] == 1) {
swap(arr[first], arr[second]);
second--;
}
else {
first++;
}
}
}
void print(int arr[], int n) {
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
cout << endl;
}
int main() {
int n;
cout << "\nEnter Size\t:\t";
cin >> n;
int *a = new int[n];
cout << "\nEnter Array Elements\n";
for ( int i = 0; i < n; i++ ) {
cin >> a[i];
}
segregate0and1( a , n);
cout << "\nArray\t:\t";
print(a,n);
delete[] a;
return 0;
}