Rosetta Code

Binary strings

Generate all binary strings of a fixed length with a simple recursive builder.

Edit the source, then Run. Checks start after your first Run. Ctrl/⌘ + Enter runs; Tab indents. Preview services use sample data and never contact a real service.

Sourcerosettacode/popular/binary_strings.vibe
def binary_strings(length: int) -> array<string>
  if length == 0
    [""]
  else
    tails = binary_strings(length - 1)
    output: array<string> = []
    index = 0
    while index < tails.length
      output.push("0" + tails.fetch(index))
      output.push("1" + tails.fetch(index))
      index = index + 1
    end
    output
  end
end

def run -> { length_four_count: int, length_three: array<string> }
  {
    length_three: binary_strings(3),
    length_four_count: binary_strings(4).length
  }
end

Output

Click Run example to see the result.

Code checks

Run once to load the checker. Your code stays in this browser.