sort01.cpp

#include <iostream>
using namespace std;

void print(int arr[], int n)
{
    for(int i=0; i<n; i++)
    {
        cout<<arr[i]<< " ";
    }
    cout<<endl;
}

void sort01(int arr[], int n)
{
    int left=0, right=n-1;
    while(left<right)
    {
        while(arr[left]==0)
        {
            left++;
        }
        while(arr[right]==1)
        {
            right--;
        }
        if(arr[left]==1 && arr[right]==0 && left< right)
        {
            swap(arr[left], arr[right]);
            left++;
            right--;
        }
    }
}


//Adding one more method
int main()
{
    int arr[8] = {1,1,0,1,0,0,0,1};
    sort01(arr, 8);
    print(arr, 8);
    return 0;
}


#include <iostream>
using namespace std;

void print(int arr[], int n)
{
    for(int i = 0; i < n; i++)
    {
        cout << arr[i] << " ";
    }
    cout << endl;
}

void sort01(int arr[], int n)
{
    int low = 0, mid = 0, high = n - 1;
    while(mid <= high)
    {
        switch(arr[mid])
        {
            case 0:
                swap(arr[low], arr[mid]);
                low++;
                mid++;
                break;
            case 1:
                mid++;
                break;
        }
    }
}

int main()
{
    int arr[8] = {1, 1, 0, 1, 0, 0, 0, 1};
    sort01(arr, 8);
    print(arr, 8);
    return 0;
}