Merge pull request kelvins#238 from Roberto-deP-Martins/main

Add Swift Binary Search algorithm

Author: kelvins

README.md

@@ -218,8 +218,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar mais pessoas a co
                 </a>
             </td>
             <td> <!-- Swift -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="./logos/github.svg" />
+                <a href="./src/swift/binarySearch.swift">
+                    <img align="center" height="25" src="./logos/swift.svg" />
                 </a>
             </td>
             <td> <!-- Rust -->
@@ -334,8 +334,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar mais pessoas a co
                 </a>
             </td>
             <td> <!-- Swift -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="./logos/github.svg" />
+                <a href="./src/swift/sequentialSearch.swift">
+                    <img align="center" height="25" src="./logos/swift.svg" />
                 </a>
             </td>
             <td> <!-- Rust -->

src/swift/binarySearch.swift

@@ -0,0 +1,35 @@
+//
+//  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
+    var middleIndex: Int;
+    while firstIndex <= lastIndex {
+        middleIndex = (firstIndex + lastIndex) / 2
+        if (searchedElement == array[middleIndex]) {
+            return middleIndex
+        }
+        searchedElement < array[middleIndex] ? (lastIndex = middleIndex - 1) : (firstIndex = middleIndex + 1)
+    }
+    return -1  // If the searched element isn't in the array
+}
+
+func main() {
+    let sortedArray = [1, 2, 3, 4, 5, 6, 7, 8, 9]
+    let elementToSearch = 5
+
+    let result = binarySearch(array: sortedArray, searchedElement: elementToSearch)
+
+    if result != -1 {
+        print("Element \(elementToSearch) found at index \(result)")
+    } else {
+        print("Element \(elementToSearch) not found in the array.")
+    }
+}
+
+main()

src/swift/sequentialSearch.swift

@@ -0,0 +1,27 @@
+/* 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 {
+            return index
+        }
+    }
+    return -1  // If element isn't found
+}
+
+func main() {
+    let numbers = [4, 7, 2, 9, 1, 5, 8]
+    let elementToSearch = 5
+
+    let result = sequentialSearch(array: numbers, searchedElement: elementToSearch)
+
+    if result != -1 {
+        print("Element \(elementToSearch) found at index \(result)")
+    } else {
+        print("Element \(elementToSearch) not found in the array.")
+    }
+}
+
+main()