diff --git a/chapters/sorting_searching/bogo/code/swift/bogosort.swift b/chapters/sorting_searching/bogo/code/swift/bogosort.swift
index 4db91083c..47df35d11 100644
--- a/chapters/sorting_searching/bogo/code/swift/bogosort.swift
+++ b/chapters/sorting_searching/bogo/code/swift/bogosort.swift
@@ -37,3 +37,10 @@ func bogoSort(sortArray: inout [Int]) -> [Int] {
 
     return sortArray
 }
+
+func main() {
+    var testArray = [4,5,123,24,34,-5]
+    print(bogoSort(sortArray: &testArray))
+}
+
+main()
diff --git a/chapters/sorting_searching/bubble/bubble_sort.md b/chapters/sorting_searching/bubble/bubble_sort.md
index 80408fa61..5a16ecc09 100644
--- a/chapters/sorting_searching/bubble/bubble_sort.md
+++ b/chapters/sorting_searching/bubble/bubble_sort.md
@@ -35,7 +35,7 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
 {% sample lang="racket" %}
 [import:5-19, lang:"racket"](code/racket/bubbleSort.rkt)
 {% sample lang="swift" %}
-[import:1-15, lang:"swift"](code/swift/bubblesort.swift)
+[import, lang:"swift"](code/swift/bubblesort.swift)
 {% endmethod %}
 
 ... And that's it for the simplest bubble sort method.