@@ -0,0 +1,1282 @@
+%22%22%22Quick Sort Algorithm.%0A%0AThe Quick Sort is a recursive sort of order in range from O(n log n) with%0Athe best pivots, to O(n2) with the worst pivots, where n is the number%0Aof elements in the array.%0A%0AQuicksort, also known as partition-exchange sort, uses these steps:%0A    1 - Choose any element of the array to be the pivot.%0A    2 - Divide all other elements (except the pivot) into two partitions.%0A    3 - All elements less than the pivot must be in the first partition.%0A    4 - All elements greater than the pivot must be in the second partition.%0A    5 - Use recursion to sort both partitions.%0A    6 - Join first sorted partition, the pivot, and the second sorted partition.%0A%0AQuicksort has a reputation as the fastest sort. Optimized variants of quicksort%0Aare common features of many languages and libraries. One often contrasts%0Aquicksort with merge sort, because both sorts have an average time%0Aof O(n log n).%0A%22%22%22%0A%0A%0Adef partition(unsorted_list):%0A    %22%22%22Partition array using a pivot value.%22%22%22%0A    return unsorted_list%0A%0A%0Adef quick_sort(unsorted_list):%0A    %22%22%22Sorts the input list using the quick sort algorithm.%0A%0A    %3E%3E%3E unsorted_list = %5B4, 5, 1, 6, 3%5D%0A    %3E%3E%3E quick_sort(unsorted_list)%0A    %5B1, 3, 4, 5, 6%5D%0A    %22%22%22%0A    unsorted_list = sorted(unsorted_list)%0A    return unsorted_list%0A

Add some info about Quick Sort