Remove author signature

Author: kelvins

src/swift/binarySearch.swift

@@ -1,10 +1,3 @@
-//
-//  binarySearch.swift
-//  
-//
-//  Written by Roberto Martins on 07/10/2023
-//  Based on the C code presented in the Portuguese Wikipedia article for Binary Search
-
 func binarySearch(array: [Int], searchedElement: Int) -> Int {
     var firstIndex: Int = 0
     var lastIndex: Int = array.count - 1

src/swift/calculatePi.swift

@@ -1,21 +1,14 @@
-//
-//  calculatePi.swift
-//  
-//
-//  Created by Matheus Torres on 14/11/20.
-//
-
 func calculatePi(_ number: Int) -> Float {
     var denominator: Float = 1
     var operation: Float = 1
     var pi: Float = 0
-    
+
     for _ in 0..<number {
         pi += operation * (4 / denominator)
         denominator += 2
         operation *= -1
     }
-    
+
     return pi
 }
 

src/swift/deque.swift

@@ -1,33 +1,26 @@
-//
-//  deque.swift
-//  
-//
-//  Created by Matheus Torres on 14/11/20.
-//
-
 class Deque {
     var deque: [Int] = []
-    
+
     func addAtBeginning(_ value: Int) {
         deque.insert(value, at: 0)
     }
-    
+
     func addAtEnd(_ value: Int) {
         deque.append(value)
     }
-    
+
     func removeAtBeggining() {
         deque.removeFirst()
     }
-    
+
     func removeAtEnd() {
         deque.removeLast()
     }
-    
+
     func read() {
         print(deque)
     }
-    
+
     func readReverse() {
         print(Array(deque.reversed()))
     }

src/swift/exponentiation.swift

@@ -1,7 +1,3 @@
-/* exponentiation.swift
-Written by Roberto Martins on 10/10/2023
-*/
-
 func exponentiation<Number: Numeric>(base: Number, power: Int) -> Number {
     var result = base
     if power == 0 {
@@ -19,4 +15,4 @@ func main() {
     print(exponentiation(base: 50, power: 0))
 }
 
-main()
+main()

src/swift/exponentiationRecursive.swift

@@ -1,7 +1,3 @@
-/* recursiveExponentiation.swift
-Written by Roberto Martins on 10/10/2023
-*/
-
 func recursiveExponentiation<Number: Numeric>(base: Number, power: Int) -> Number {
     if (power == 0) {
         return 1
@@ -15,4 +11,4 @@ func main() {
     print(recursiveExponentiation(base: 50, power: 0))
 }
 
-main()
+main()

src/swift/factorial.swift

@@ -1,9 +1,3 @@
-//
-//  factorial.swift
-//
-//  Created by Matheus Torres on 13/11/20.
-//
-
 func factorial(_ number: Int) -> Int {
     var result: Int = 1
     for index in (1...number).reversed() {

src/swift/factorialRecursive.swift

@@ -1,9 +1,3 @@
-//
-//  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)

src/swift/insertionSort.swift

@@ -1,10 +1,3 @@
-//
-//  insertionSort.swift
-//
-//
-//  Created by Matheus Torres on 14/11/20.
-//
-
 func insertionSort(_ array: [Int]) -> [Int] {
     var newArray: [Int] = array
     for i in 1..<newArray.count {

src/swift/linearSearch.swift

@@ -1,7 +1,3 @@
-/* sequentialSearch.swift
-Written by Roberto Martins on 07/10/2023
-*/
-
 func sequentialSearch(array: [Int], searchedElement: Int) -> Int {
     for index in 0..<array.count {
         if array[index] == searchedElement {

src/swift/palindrome.swift

@@ -1,9 +1,3 @@
-//
-//  palindromo.swift
-//
-//  Created by Matheus Torres on 14/11/20.
-//
-
 import Foundation
 
 func isPalindrome(_ string: String) -> Bool {

src/swift/queue.swift

@@ -1,24 +1,18 @@
-//
-//  fila.swift
-//
-//  Created by Matheus Torres on 14/11/20.
-//
-
 class Queue {
     var queue: [Int] = []
-    
+
     func enqueue(_ value: Int) {
         self.queue.append(value)
     }
-    
+
     func dequeue() {
         self.queue.removeFirst()
     }
-    
+
     func show() {
         print(self.queue)
     }
-    
+
     func clear() {
         self.queue = []
     }

src/swift/singlyLinkedList.swift

@@ -1,8 +1,4 @@
-/* singlyLinkedList.swift
-Written by Roberto Martins on 09/10/2023
-*/
-
-// Type: Equatable makes it so that you can have Nodes of any type and their values can be compared 
+// Type: Equatable makes it so that you can have Nodes of any type and their values can be compared
 // Use of generic "Type" makes it so you can have a Linked List of any type
 class Node<Type: Equatable>
 {
@@ -51,7 +47,7 @@ class LinkedList<Type: Equatable> {
             currentNode = currentNode!.next
         }
     }
-    
+
     func remove(value: Type) {
         var currentNode = self.head
         var previousNode: Node<Type>? = nil
@@ -116,4 +112,4 @@ func main() {
     stringsLinkedList.printList()
 }
 
-main()
+main()

src/swift/stack.swift

@@ -1,10 +1,3 @@
-//
-//  stack.swift
-//
-//
-//  Created by Matheus Torres on 14/11/20.
-//
-
 class Stack {
     var stack: [Int] = []
 

src/swift/towerOfHanoi.swift

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