Merge pull request #197 from kelvins/translation/swift

Translate Swift algorithms to English

Author: kelvins

README.md

@@ -856,7 +856,7 @@ Com o objetivo de alcançar uma abrangência maior e encorajar mais pessoas a co
   </a>
   </td>
   <td> <!-- Swift -->
-  <a href="./src/swift/fatorial.swift">
+  <a href="./src/swift/factorial.swift">
   <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/swift/swift-original.svg" />
   </a>
   </td>
@@ -914,7 +914,7 @@ Com o objetivo de alcançar uma abrangência maior e encorajar mais pessoas a co
   </a>
   </td>
   <td> <!-- Swift -->
-  <a href="./src/swift/fatorialRecursivo.swift">
+  <a href="./src/swift/recursiveFactorial.swift">
   <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/swift/swift-original.svg" />
   </a>
   </td>
@@ -1786,7 +1786,7 @@ Com o objetivo de alcançar uma abrangência maior e encorajar mais pessoas a co
   </a>
   </td>
   <td> <!-- Swift -->
-  <a href="./src/swift/fila.swift">
+  <a href="./src/swift/queue.swift">
   <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/swift/swift-original.svg" />
   </a>
   </td>
@@ -2250,7 +2250,7 @@ Com o objetivo de alcançar uma abrangência maior e encorajar mais pessoas a co
   </a>
   </td>
   <td> <!-- Swift -->
-  <a href="./src/swift/pilha.swift">
+  <a href="./src/swift/stack.swift">
   <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/swift/swift-original.svg" />
   </a>
   </td>
@@ -3530,7 +3530,7 @@ Com o objetivo de alcançar uma abrangência maior e encorajar mais pessoas a co
   </a>
   </td>
   <td> <!-- Swift -->
-  <a href="./src/swift/palindromo.swift">
+  <a href="./src/swift/palindrome.swift">
   <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/swift/swift-original.svg" />
   </a>
   </td>

src/swift/fatorial.swift src/swift/factorial.swiftsrc/swift/fatorial.swift renamed to src/swift/factorial.swift

@@ -1,16 +1,16 @@
 //
-// fatorial.swift
-// 
+// factorial.swift
+//
 // Created by Matheus Torres on 13/11/20.
 //
 
-func fatorial(_ number: Int) -> Int {
+func factorial(_ number: Int) -> Int {
  var result: Int = 1
  for index in (1...number).reversed() {
  result = result * index
  }
  return result
 }
 
-print(fatorial(5))
+print(factorial(5))
 

src/swift/fatorialRecursivo.swift

@@ -1,18 +1,18 @@
 //
 // hanoi.swift
-// 
+//
 // Created by Matheus Torres on 13/11/20.
 //
 
-func hanoi(_ p1: Int, _ p2: Int, _ p3: Int, discos: Int) {
- if discos == 1 {
+func hanoi(_ p1: Int, _ p2: Int, _ p3: Int, disks: Int) {
+ if disks == 1 {
  print("Move de \(p1) para \(p2)")
  } else {
- hanoi(p1, p3, p2, discos: discos - 1)
- hanoi(p1, p2, p3, discos: 1)
- hanoi(p3, p2, p1, discos: discos - 1)
+ hanoi(p1, p3, p2, disks: disks - 1)
+ hanoi(p1, p2, p3, disks: 1)
+ hanoi(p3, p2, p1, disks: disks - 1)
  }
 }
 
-hanoi(0, 2, 1, discos: 3)
+hanoi(0, 2, 1, disks: 3)
 

src/swift/hanoi.swift

@@ -1,6 +1,6 @@
 //
 // insertionSort.swift
-// 
+//
 //
 // Created by Matheus Torres on 14/11/20.
 //
@@ -19,6 +19,6 @@ func insertionSort(_ array: [Int]) -> [Int] {
  return newArray
 }
 
-let arrayNaoOrdenado: [Int] = [92, 23, 42, 12, 54, 65, 1, 2, 8, 9, 31, 99]
-print(insertionSort(arrayNaoOrdenado))
+let unsortedArray: [Int] = [92, 23, 42, 12, 54, 65, 1, 2, 8, 9, 31, 99]
+print(insertionSort(unsortedArray))
 

src/swift/insertionSort.swift

@@ -0,0 +1,12 @@
+//
+// factorial.swift
+//
+// Created by Matheus Torres on 13/11/20.
+//
+
+func factorial(_ number: Int) -> Int {
+ if number <= 1 { return 1 }
+ return number * factorial(number - 1)
+}
+
+print(factorial(7))

src/swift/palindromo.swift src/swift/palindrome.swiftsrc/swift/palindromo.swift renamed to src/swift/palindrome.swift

@@ -0,0 +1,40 @@
+//
+// stack.swift
+//
+//
+// Created by Matheus Torres on 14/11/20.
+//
+
+class Stack {
+ var stack: [Int] = []
+
+ func push(_ value: Int) {
+ stack.append(value)
+ }
+
+ func pop() {
+ stack.removeLast()
+ }
+
+ func show() {
+ print(stack)
+ }
+
+ func clean() {
+ stack = []
+ }
+}
+
+let stack = Stack()
+
+stack.push(1)
+stack.push(2)
+stack.push(3)
+stack.push(4)
+
+stack.show()
+
+stack.pop()
+stack.pop()
+stack.show()
+