Finding all combinations of well-formed brackets

by

Took a crack at it.. C# also. 

public void Brackets(int n) {
    for (int i = 1; i <= n; i++) {
        Brackets("", 0, 0, i);
    }
}

private void Brackets(string output, int open, int close, int pairs) {
    if((open==pairs)&&(close==pairs)) {
        Console.WriteLine(output);
    } else {
        if(open<pairs)
            Brackets(output + "(", open+1, close, pairs);
        if(close<open)
            Brackets(output + ")", open, close+1, pairs);
    }
}

The recursion is taking advantage of the fact that you can never add more opening brackets than the desired number of pairs, and you can never add more closing brackets than opening brackets..

More Related Contents:

  1. I am interested in a more optimized solution for sum of all fizzbuzz numbers in a given range
  2. Different combinations of an array (C#)
  3. Algorithm to detect overlapping periods [duplicate]
  4. What is the best way to find all combinations of items in an array?
  5. Select N random elements from a List in C#
  6. Good GetHashCode() override for List of Foo objects respecting the order
  7. Quick and Simple Hash Code Combinations
  8. Random weighted choice
  9. What are the benefits of using C# vs F# or F# vs C#? [closed]
  10. Nice & universal way to convert List of items to Tree
  11. Sum of digits in C#
  12. C# hashcode for array of ints
  13. Efficient Cartesian Product algorithm
  14. Best hashing algorithm in terms of hash collisions and performance for strings
  15. LINQ to find series of consecutive numbers
  16. Generate tail call opcode
  17. Reversible shuffle algorithm using a key
  18. DirectoryInfo.EnumerateFiles(…) causes UnauthorizedAccessException (and other exceptions)
  19. How to get all the possible 3 letter permutations? [duplicate]
  20. C#: Seeking PNG Compression algorithm/library [closed]
  21. Memory-constrained external sorting of strings, with duplicates combined&counted, on a critical server (billions of filenames)
  22. Find if point lies on line segment
  23. What’s the quickest way to compute log2 of an integer in C#?
  24. Flood Fill Algorithms
  25. Creating a power set of a Sequence
  26. All cases covered Bresenham’s line-algorithm [closed]
  27. Sorting a linked list
  28. How to round decimal value up to nearest 0.05 value?
  29. Detect a specific frequency/tone from raw wave-data
  30. C#: How to make Sieve of Atkin incremental

Leave a Comment