Initialize repo with README and examples

Author: yshshrm

README.md

@@ -0,0 +1,22 @@
+# Data Structures and Algorithms
+For Hacktoberfest 2018! <br/>
+
+Check your own profile stats after registering here: https://hacktoberfest.digitalocean.com/stats/<username>
+
+### About
+This Repo consists of data-structures and algorithms sorted by programming language.
+
+### Contributing Guidelines
+- The repository is structured language-wise i.e. algorithms in a certain language go in a specific folder.
+- The naming convention to be followed is ```algo_name.language_extention``` i.e. the overall pathshould be ```language/algo_name.language_extention```
+- Example of above points: heapsort in Java should go into `java/heapsort.java`
+- It is your choice to include only the function or the entire program for the algo.
+- If folder for your language does not exist, create a new one.
+- Don't be afraid to make a PR!
+
+### How to make PR
+1. Fork Repo on Web Page.
+2. Make your changes on your forked repo.
+3. Make Pull Request to master.
+
+Hack on!

cpp/selection_sort.cpp

@@ -0,0 +1,43 @@
+#include <iostream>
+using namespace std;
+
+// perform selection sort on arr[]
+void selectionSort(int arr[], int n)
+{
+	// run (n - 1) times
+	for (int i = 0; i < n - 1; i++) 
+	{
+		// find the minimum element in the unsorted subarray[i..n-1] 
+		// and swap it with arr[i]
+		int min = i;
+		
+		for (int j = i + 1; j < n; j++)
+		{
+			// if arr[j] element is less, then it is the new minimum
+			if (arr[j] < arr[min])
+				min = j;	// update index of min element
+		}
+
+		// swap the minimum element in subarray[i..n-1] with arr[i]
+		swap(arr[min], arr[i]);
+	}
+}
+
+// Function to print n elements of the array arr
+void printArray(int arr[], int n)
+{
+	for (int i = 0; i < n; i++)
+		cout << arr[i] << " ";
+}
+
+// main function
+int main()
+{
+	int arr[] = { 3, 5, 8, 4, 1, 9, -2 };
+	int n = sizeof(arr) / sizeof(arr[0]);
+
+	selectionSort(arr, n);
+	printArray(arr, n);
+
+	return 0;
+}