This post discusses the solution to a popular 2 dimensional dynamic programming problem known as “Edit Distance”. A working understanding of dynamic programming is needed to understand this post.
This post explains the solution of the rat in a maze problem. A rat which is trapped inside a maze can escape only by moving forward or down.
This post explain the selection sort algorithm. It is simple yet fundamental for beginners.
This post talks about binary search.A simple yet important algorithm for beginners.
This post provides an introduction to genetic algorithms and includes an implementation of a primitive genetic optimisation algorithm in Python.
This article is an introduction to the concept of linked lists for absolute beginners.
This article will be dealing with how computers calculate trigonometric ratios, logarithms, and exponents. We will be exploring the mathematics behind these functions and shall […]
This is a basic search algorithm which is useful for short arrays or lists.
This posts gives an introduction to the vast and important concept of dynamic programming. This will give anyone the tools needed to start writing complex DP algorithms.
This post talks about the minimax decision making algorithm and includes a scala implementation of a tic-tac-toe-playing AI that uses minimax.