Search algorithms that are used to retrieve information from a data structure, in this post I'll describe 3 search algorithms to find an element in lists
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.
Checking if a Binary Tree is a BST step by step
There are some ways to reverse a Singly Linked List, the one that I want to show here doesn't require extra space.
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.