Selection sort code and description added

Author: Shaon

.gitignore

@@ -1,6 +1 @@
-*
-!*.md
-!/*.md
-!/*.c
-!*.png
-!/*.png
+

Sorting/Selection Sort/README.md

@@ -0,0 +1,24 @@
+# Selection Sort
+
+**Selection sort** is one of the simplest sorting algorithm.
+It works by selecting the smallest (or largest, if you want to sort from big to small) element of the array and placing it at the head of the array. Then the process is repeated for the remainder of the array; the next largest element is selected and put into the next slot, and so on down the line.
+
+![Selection Sort](selection_sort.jpg)
+
+Selection sort algorithm starts by compairing first two elements of an array and swapping if necessary, i.e., if you want to sort the elements of array in ascending order and if the first element is greater than second then, you need to swap the elements but, if the first element is smaller than second, leave the elements as it is. Then, again first element and third element are compared and swapped if necessary. This process goes on until first and last element of an array is compared. This completes the first step of selection sort.
+
+If there are n elements to be sorted then, the process mentioned above should be repeated n-1 times to get required result.
+
+#####A visualization on Selection Sort
+![Selection sort demonstration](https://upload.wikimedia.org/wikipedia/commons/9/94/Selection-Sort-Animation.gif)
+
+*Selection sort animation. Red is current min. Yellow is sorted list. Blue is current item.*
+
+####Complexity Analysis
+- Worst Case - O(n^2)
+- Average Case - O(n^2)
+- Best Case - O(n^2)
+### More on this topic
+- https://en.wikipedia.org/wiki/Selection_sort
+- http://quiz.geeksforgeeks.org/selection-sort/
+- https://www.topcoder.com/community/data-science/data-science-tutorials/sorting/

Sorting/Selection Sort/selection_sort.c

@@ -0,0 +1,60 @@
+#include <stdio.h>
+
+//Following function will sort the array in Increasing (ascending) order
+void selection_sort(int arr[], int n)
+{
+    int i, j, tmp;
+
+    /* advance the position through the entire array */
+    /*   (could do i < n-1 because single element is also min element) */
+    for (i = 0; i < n-1; i++)
+    {
+        // find the min element in the unsorted a[i .. n-1]
+
+        int current_Min = i; // assume the min is the first element
+        // test against elements after i to find the smallest
+        for ( j = i+1; j < n; j++)
+        {
+            // if this element is less, then it is the new minimum
+            if (arr[j] < arr[current_Min]) //To sort in decreasing order just change the comparison operator to '>'
+            {
+                current_Min = j; // found new minimum; remember its index
+            }
+        }
+
+        if(current_Min != i) //if the current_Min is equal to i, then it is in right position already
+        {
+            //Swap the values
+            tmp = arr[i];
+            arr[i] = arr[current_Min];
+            arr[current_Min] = tmp;
+        }
+    }
+}
+
+void print_list(int arr[], int num_of_element)
+{
+    int i;
+    for(i = 0; i < num_of_element; i++)
+    {
+        printf("%d ", arr[i]);
+    }
+
+    printf("\n");
+}
+
+int main(int argc, char const *argv[])
+{
+    int arr[] = {43, 1, 24, 56, 30, 5};
+    int num_of_element = sizeof(arr)/sizeof(int);
+
+    printf("Initial List:\n");
+    print_list(arr, num_of_element);
+
+    selection_sort(arr, num_of_element);
+
+    printf("Sorted list in ascending order: \n");
+    print_list(arr, num_of_element);
+
+    return 0;
+}