#include
using namespace std;
void dnfsorting(int a[],int n){
int lo=0;
int mid=0;
int high=n-1;
while(mid<=high){
if(a[mid]==0){
swap(a[mid],a[lo]);
lo++;
mid++;
}
if(a[mid]==1){
mid++;
}
if(a[mid]==2){
swap(a[mid],a[high]);
high–;
}
}
return;
}
int main(){
int a[]={1,2,0,0,2,1,0,1,2};
int n=sizeof(a)/sizeof(int);
dnfsorting(a,n);
for(int i=0;i<n;i++){
cout<<a[i]<<" ";
}
return 0;
}