Sort an array of 0s, 1s and 2s

Given an array A[] consisting 0s, 1s and 2s, write a function that sorts A[]. The functions should put all 0s first, then all 1s and all 2s in last.
Examples:

Input :  {0, 1, 2, 0, 1, 2}
Output : {0, 0, 1, 1, 2, 2}

Input :  {0, 1, 1, 0, 1, 2, 1, 2, 0, 0, 0, 1}
Output : {0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2}

A simple solution is discussed in below post.
Sort an array of 0s, 1s and 2s (Simple Counting)

The problem is similar to our old post Segregate 0s and 1s in an array, and both of these problems are variation of famous Dutch national flag problem.

The problem was posed with three colours, here `0′, `1′ and `2′. The array is divided into four sections:

  1. a[1..Lo-1] zeroes (red)
  2. a[Lo..Mid-1] ones (white)
  3. a[Mid..Hi] unknown
  4. a[Hi+1..N] twos (blue)

The unknown region is shrunk while maintaining these conditions



  1. Lo := 1; Mid := 1; Hi := N;
  2. while Mid <= Hi do
    1. Invariant: a[1..Lo-1]=0 and a[Lo..Mid-1]=1 and a[Hi+1..N]=2; a[Mid..Hi] are unknown.
    2. case a[Mid] in
      • 0: swap a[Lo] and a[Mid]; Lo++; Mid++
      • 1: Mid++
      • 2: swap a[Mid] and a[Hi]; Hi–

— Dutch National Flag Algorithm, or 3-way Partitioning —

filter_none

edit
close

play_arrow

link
brightness_4
code

<script type="text/javascript"
// <![CDATA[
function dnf(N)
    var a = new Array(N + 1);
    var i;
    document.theForm3.opt.value = '';
    document.theForm3.trace.value = '';
      
    for(i = 1; i <= N; i++)
        a[i] = Math.round(100 * Math.random()) % 3;
    for(i = 1; i <= N; i++) 
        document.theForm3.opt.value += ' ' + a[i];
      
    var Lo = 1, Mid = 1, Hi = N;
    while( Mid - 0 <= Hi )
    {
        // inv: a[1..Lo-1]=0 && a[Lo..Mid-1]=1 && 
        //      a[Hi+1..N]=2, a[Mid..Hi] unknown.
        if(a[Mid] - 0 == 0)
        
            var temp = a[Mid]; 
                a[Mid] = a[Lo]; 
                a[Lo] = temp;
            Lo++; // the zeros' section grew
            Mid++;
        }
        else if(a[Mid]-0 == 1)
            Mid++; // ones' section grew
        else// ==2
        
            var temp = a[Hi]; 
                a[Hi] = a[Mid]; 
                a[Mid] = temp;
            Hi--; // the twos' section grew
        }
      
        for(i = 1; i <= N; i++)
            if( i - 0 < Mid || i - 0 > Hi)
            document.theForm3.trace.value += ' ' + a[i];
            else
            document.theForm3.trace.value += ' ';
        document.theForm3.trace.value += 'n';
    }
}
// ]]></script>                    

chevron_right


Part way through the process, some red, white and blue elements are known and are in the “right” place. The section of unknown elements, a[Mid..Hi], is shrunk by examining a[Mid]:

DNF1

Examine a[Mid]. There are three possibilities: 
a[Mid] is (0) red, (1) white or (2) blue.
Case (0) a[Mid] is red, swap a[Lo] and a[Mid]; Lo++; Mid++

DNF2


Case (1) a[Mid] is white, Mid++

DNF3


Case (2) a[Mid] is blue, swap a[Mid] and a[Hi]; Hi--

DNF4

Continue until Mid>Hi. 

Below is the implementation of above algorithm.

C

filter_none

edit
close

play_arrow

link
brightness_4
code

// C program to sort an array with 0,1 and 2
// in a single pass
#include<stdio.h>
  
/* 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 lo = 0;
    int hi = arr_size - 1;
    int mid = 0;
  
    while (mid <= hi)
    {
        switch (a[mid])
        {
        case 0:
            swap(&a[lo++], &a[mid++]);
            break;
        case 1:
            mid++;
            break;
        case 2:
            swap(&a[mid], &a[hi--]);
            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);
  
    getchar();
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to sort an array of 0, 1 and 2
import java.io.*;
  
class countzot {
  
    // Sort the input array, the array is assumed to
    // have values in {0, 1, 2}
    static void sort012(int a[], int arr_size)
    {
        int lo = 0;
        int hi = arr_size - 1;
        int mid = 0,temp=0;
        while (mid <= hi)
        {
            switch (a[mid])
            {
            case 0:
            {
                temp   =  a[lo];
                a[lo]  = a[mid];
                a[mid] = temp;
                lo++;
                mid++;
                break;
            }
            case 1:
                mid++;
                break;
            case 2:
            {
                temp = a[mid];
                a[mid] = a[hi];
                a[hi] = temp;
                hi--;
                break;
            }
            }
        }
    }
  
    /* Utility function to print array arr[] */
    static void printArray(int arr[], int arr_size)
    {
        int i;
        for (i = 0; i < arr_size; i++)
            System.out.print(arr[i]+" ");
        System.out.println("");
    }
  
    /*Driver function to check for above functions*/
    public static void main (String[] args)
    {
        int arr[] = {0, 1, 1, 0, 1, 2, 1, 2, 0, 0, 0, 1};
        int arr_size = arr.length;
        sort012(arr, arr_size);
        System.out.println("Array after seggregation ");
        printArray(arr, arr_size);
    }
}
/*This code is contributed by Devesh Agrawal*/

chevron_right


Python

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python program to sort an array with 0,1 and 2 in a siingle pass
  
# Function to sort array
def sort012( a, arr_size):
    lo = 0
    hi = arr_size - 1
    mid = 0
    while mid <= hi:
        if a[mid] == 0:
            a[lo],a[mid] = a[mid],a[lo]
            lo = lo + 1
            mid = mid + 1
        elif a[mid] == 1:
            mid = mid + 1
        else:
            a[mid],a[hi] = a[hi],a[mid] 
            hi = hi - 1
return a
      
# Function to print array
def printArray( a):
    for k in a:
        print k,
    print
      
  
# Driver Program
arr = [0, 1, 1, 0, 1, 2, 1, 2, 0, 0, 0, 1]
arr_size = len(arr)
arr = sort012( arr, arr_size)
print "Array aftter segregation :",
printArray(arr)
  
# Contributed by Harshit Agrawal

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# program to sort an 
// array of 0, 1 and 2
using System;
  
class GFG
{
    // Sort the input array, the array is assumed to
    // have values in {0, 1, 2}
    static void sort012(int []a, int arr_size)
    {
        int lo = 0;
        int hi = arr_size - 1;
        int mid = 0,temp=0;
          
        while (mid <= hi)
        {
            switch (a[mid])
            {
            case 0:
            {
                temp = a[lo];
                a[lo] = a[mid];
                a[mid] = temp;
                lo++;
                mid++;
                break;
            }
            case 1:
                mid++;
                break;
            case 2:
            {
                temp = a[mid];
                a[mid] = a[hi];
                a[hi] = temp;
                hi--;
                break;
            }
            }
        }
    }
  
    /* Utility function to print array arr[] */
    static void printArray(int []arr, int arr_size)
    {
        int i;
          
        for (i = 0; i < arr_size; i++)
            Console.Write(arr[i] + " ");
        Console.WriteLine("");
    }
  
    /*Driver function to check for above functions*/
    public static void Main ()
    {
        int []arr = {0, 1, 1, 0, 1, 2, 1, 2, 0, 0, 0, 1};
        int arr_size = arr.Length;
        sort012(arr, arr_size);
          
        Console.Write("Array after seggregation ");
          
        printArray(arr, arr_size);
    }
}
  
//This code is contributed by Sam007

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php 
// PHP program to sort an array
// with 0,1 and 2 in a single pass
  
// Sort the input array, the array is 
// assumed to have values in {0, 1, 2}
function sort012(&$a, $arr_size)
{
    $lo = 0;
    $hi = $arr_size - 1;
    $mid = 0;
  
    while ($mid <= $hi)
    {
        switch ($a[$mid])
        {
        case 0:
            swap($a[$lo++], $a[$mid++]);
            break;
        case 1:
            $mid++;
            break;
        case 2:
            swap($a[$mid], $a[$hi--]);
            break;
        }
    }
}
  
/* UTILITY FUNCTIONS */
function swap(&$a, &$b)
{
    $temp = $a;
    $a = $b;
    $b = $temp;
}
  
/* Utility function to print array arr[] */
function printArray(&$arr, $arr_size)
{
    for ($i = 0; $i < $arr_size; $i++)
        echo $arr[$i]." ";
    echo "\n";
}
  
// Driver Code
$arr = array(0, 1, 1, 0, 1, 2, 
             1, 2, 0, 0, 0, 1);
$arr_size = sizeof($arr);
  
sort012($arr, $arr_size);
  
echo "array after segregation ";
printArray($arr, $arr_size);
  
// This code is contributed
// by ChitraNayal
?>

chevron_right


Output:

array after segregation 0 0 0 0 0 1 1 1 1 1 2 2 

Time Complexity: O(n)

The above code performs unnecessary swaps for inputs like 0 0 0 0 1 1 1 2 2 2 2 2 : lo=4 and mid=7 and hi=11. In present code: first 7 exchanged with 11 and hi become 10 and mid is still pointing to 7. again the same operation is done till mid <= hi. But it is really not required. We can change the swap function to do a check that the values being swapped are same or not, if not same, then only swap values. Thanks to Ankur Roy for suggesting this optimization. Source: http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Sort/Flag/

Please write comments if you find the above code/algorithm incorrect, or find better ways to solve the same problem.



My Personal Notes arrow_drop_up

Improved By : ChitraNayal