Merge pull request #985 from 5ar5kovic/patch-1

Update README.md

Author: matthewsamuel95

Sorting/QuickSort/README.md

@@ -1,5 +1,5 @@
-<h1>QickSort</h1>
+<h1>QuickSort</h1>
 <p>Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. Developed by British computer scientist Tony Hoare in 1959 and published in 1961, it is still a commonly used algorithm for sorting. When implemented well, it can be about two or three times faster than its main competitors, merge sort and heapsort.</p>
 <img src="https://upload.wikimedia.org/wikipedia/commons/6/6a/Sorting_quicksort_anim.gif">
 
-<a href="https://en.wikipedia.org/wiki/Quicksort">Source: Wikipedia</a>
+<a href="https://en.wikipedia.org/wiki/Quicksort">Source: Wikipedia</a>