📄️ Trivial Sort
Sorting is a fundamental problem in computer science. It relates to many other problems. (useless nonsense)
📄️ Merge Sort
Merge sort is a divide-and-conquer algorithm that divides the input array into two halves, recursively sorts each half, and then merges the two sorted halves.
📄️ Heap Sort
Heap is a data structure that is a complete binary tree that satisfies the heap property.
📄️ Topological Sort
Topological sort is a linear ordering of the vertices of a directed acyclic graph (DAG) such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering.