Hi 👋 I'm César. I'm here to help you write better code.
Intermediate Graph: Principles of Dijkstra's and Bellman Ford's Algorithm
In this article we will look at two very important graph algorithms, Djiktra’s algorithm as well as Bellman Ford’s algorithm.
Graph toolbox: Solving Paint a Boolean Matrix
In this article we will look to solve another classic graph and matrix problem, painting a boolean matrix.
Graph toolbox: Let's solve search maze problem
In this article we will look to solve one of the classic graph problems, searching in a maze.
Graphs 101: Let's BFS and DFS
In this article we will dive into graph basics. There are two graph traversals: breadth first search and depth first search.
Algorithm toolbox: Bubble Sort
Bubble sort is a simple comparison algorithm with a quadratic runtime of **O(n²)** time. This algorithm is simple and easy to implement, however it is important to note that it is the most inefficient sorting algorithm in our arsenal.
Algorithm toolbox: Insertion Sort
Some implementations of more advanced algorithms will even switch from using their more advanced methodology to insertion sort when the list gets small enough.