Updated files for 2 spaced-indentations

Author: kelvinlauKL

Shuffle/Shuffle.playground/Sources/Shuffle.swift

@@ -2,15 +2,15 @@ import Foundation
 
 /* Returns a random integer between 0 and n-1. */
 public func random(_ n: Int) -> Int {
-    return Int(arc4random_uniform(UInt32(n)))
+  return Int(arc4random_uniform(UInt32(n)))
 }
 
 extension Array {
   /*
-    Randomly shuffles the array in-place
-    This is the Fisher-Yates algorithm, also known as the Knuth shuffle.
-    Time complexity: O(n)
-  */
+   Randomly shuffles the array in-place
+   This is the Fisher-Yates algorithm, also known as the Knuth shuffle.
+   Time complexity: O(n)
+   */
   public mutating func shuffle() {
     for i in (1...count-1).reversed() {
       let j = random(i + 1)
@@ -24,8 +24,8 @@ extension Array {
 }
 
 /*
-  Simultaneously initializes an array with the values 0...n-1 and shuffles it.
-*/
+ Simultaneously initializes an array with the values 0...n-1 and shuffles it.
+ */
 public func shuffledArray(_ n: Int) -> [Int] {
   var a = Array(repeating: 0, count: n)
   for i in 0..<n {

Shuffle/Shuffle.swift

@@ -2,39 +2,39 @@ import Foundation
 
 /* Returns a random integer between 0 and n-1. */
 public func random(_ n: Int) -> Int {
-    return Int(arc4random_uniform(UInt32(n)))
+  return Int(arc4random_uniform(UInt32(n)))
 }
 
 extension Array {
-    /*
-     Randomly shuffles the array in-place
-     This is the Fisher-Yates algorithm, also known as the Knuth shuffle.
-     Time complexity: O(n)
-     */
-    public mutating func shuffle() {
-        for i in (1...count-1).reversed() {
-            let j = random(i + 1)
-            if i != j {
-                let t = self[i]
-                self[i] = self[j]
-                self[j] = t
-            }
-        }
+  /*
+   Randomly shuffles the array in-place
+   This is the Fisher-Yates algorithm, also known as the Knuth shuffle.
+   Time complexity: O(n)
+   */
+  public mutating func shuffle() {
+    for i in (1...count-1).reversed() {
+      let j = random(i + 1)
+      if i != j {
+        let t = self[i]
+        self[i] = self[j]
+        self[j] = t
+      }
     }
+  }
 }
 
 /*
  Simultaneously initializes an array with the values 0...n-1 and shuffles it.
  */
 public func shuffledArray(_ n: Int) -> [Int] {
-    var a = Array(repeating: 0, count: n)
-    for i in 0..<n {
-        let j = random(i + 1)
-        if i != j {
-            a[i] = a[j]
-        }
-        a[j] = i  // insert next number from the sequence
+  var a = Array(repeating: 0, count: n)
+  for i in 0..<n {
+    let j = random(i + 1)
+    if i != j {
+      a[i] = a[j]
     }
-    return a
+    a[j] = i  // insert next number from the sequence
+  }
+  return a
 }