{"ref":null,"ref_type":"repository","master_branch":"master","description":"The Dutch national flag problem is a partitioning problem proposed and solved by E. Dijkstra in the 1970s. The algorithms takes as inputs an array t with domain 1..N and values in 0..MAXINT (N and MAXINT are parameters), and two values low and high in 0..MAXINT, such that low < high. The value low represents the biggest \"red\" value and high is the smallest \"blue\" value.","pusher_type":"user"}
{"actor":{"display_login":"lirandepira"}}