title: How to print the Fibonacci sequence in Swift Playground using recursion
body: <p>I am trying to use recursion in Swift to print out the Fibonacci sequence for a number "n" iterations. However, I keep getting the same error.</p>
  
  <p>I have already tried doing it without recursion and was able to do it. However, I am now trying to do in a more complex and "computer scientisty" way by using recursion.</p>
  
  <pre><code>func fibonacciSequence (n: Int) -&gt; [Int]  {
  
  // Consumes a number "n", which is the number of iterations to go through with the Fibonacci formula and prints such sequence.
  
      var fibonacciArray = [Int]()
  
      for n in 0 ... n {
  
          if n == 0 {
              fibonacciArray.append(0)
          }
          else if n == 1 {
              fibonacciArray.append(1)
          }
          else {
              fibonacciArray.append (fibonacciSequence(n: (n - 1)) +
              fibonacciSequence(n: (n-2)))
          }
      }
      return fibonacciArray
  </code></pre>
  
  <p>I expect to call the function with a number n and for the function to print out the Fibonacci sequence. Example: if n = 5, I expect the console to print 0, 1, 1, 2, 3, 5. The error I get is this: (Cannot convert value of type '[Int]' to expected argument type 'Int').</p>