## Quick Sort

Quick Sort is an in-place sorting algorithm that uses a divide-and-conquer technique to sort a given list

Quick Sort is an in-place sorting algorithm that uses a divide-and-conquer technique to sort a given list

Merge sort is a sorting algorithm that uses a divide-and-conquer technique to sort a given list

In this post, I'll describe three sorting algorithms that, although not the most efficient, are easy to understand.

Topological sort is an ordering of the vertices of a directed acyclic graph, in a way that if there is an edge from a vertex A to B, then A comes before B.