Big O notation is a way of describing the performance of a function without using time. Rather than timing a function from start to finish, big O describes how the time grows as the input size increases. It is used to help understand how programs will perform across a range of inputs.

Graph search algorithms let us find the shortest path on a map represented as a graph. Move the blob (start point) and cross (end point) to see the shortest path found by the A* Algorithm.

Graph search algorithms let us find the shortest path on a map represented as a graph. Move the blob (start point) and cross (end point) to see the shortest path found by the A* Algorithm.

One challenge of indie game development is about striking a balance. Specifically, the balance… Tagged with gamedev, algorithms, typescript, excaliburjs.

Author discusses how he accidentally wrote a parser with quadratic complexity.