Dutch National Flag (DNF) problem (3-way partitioning) - Algorithms and Problem SolvingAlgorithms and Problem Solving

Dutch National Flag (DNF) problem (3-way partitioning) - Algorithms and Problem SolvingAlgorithms and Problem Solving

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.

Example
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}

Read full article from Dutch National Flag (DNF) problem (3-way partitioning) - Algorithms and Problem SolvingAlgorithms and Problem Solving