Merge pull request deutranium#1 from Grasstown/SelectionSort

Add readme for SelectionSort

Author: Grasstown

sortingAlgo/selectionSort/selectionSort.md

@@ -0,0 +1,30 @@
+# Selection Sort
+Selection sort is an algorithm that separates an array into two subsections: a sorted section, and an unsorted section. The array is sorted by moving the lowest value element to the beginning of the unsorted section. It can also be adjusted to sort in reverse order.
+```
+selection sort(array)
+  for i <- 0 to indexOfLastElement:
+    k = i
+    for j <- i + 1 to indexOfLastElement:
+      if (array[j] < array[k])
+        k = j    
+    swap array[k] and array[i]
+```
+
+# Time Complexities:
+- Worst Case/Average: O(n<sup>2</sup>)
+- Best Case: O(n)
+Selection sort is inefficient on large lists.
+
+# Space Complexity:
+- O(1)
+Selection sort has a space complexity of O(1), making it efficient when memory is lacking.
+
+# Instructions for running Code:
+- cpp
+```
+ g++ selectionSort.cc
+ ./a.out
+ ```
+ - python
+ ```
+ python3 selectionSort.py