Add a Readme file to Heap Sort (#348)

daniloeler · tstreamDOTh · commit 724a3baee454 · 2018-10-29T23:00:40.000+05:30
diff --git a/Sorting/Heap Sort/Readme.md b/Sorting/Heap Sort/Readme.md
@@ -0,0 +1,3 @@
+# Heap Sort
+Heap sort is a selection based algorithm. It has an ideia similar to Selection Sort. However, instead o search the element in a list (or array), the Heap Sort search the elements in a balanced tree computed as a Heap.
+The time complexiy of Heap Sort is allways O(nlogn).

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Heap Sort`
	`2`	`+Heap sort is a selection based algorithm. It has an ideia similar to Selection Sort. However, instead o search the element in a list (or array), the Heap Sort search the elements in a balanced tree computed as a Heap.`
	`3`	`+The time complexiy of Heap Sort is allways O(nlogn).`