Reviews
Finding the shortest route through a graph usually brings Dijkstra’s algorithm to mind. It is fast and useful, but it relies on an important assumption: every…
Autocomplete turns partial input into useful suggestions before a user has finished typing. Search boxes, code editors, command palettes and mobile keyboards…
A Fenwick tree, also called a Binary Indexed Tree, is a compact data structure for maintaining cumulative values while data changes. It supports prefix-sum…
Stooge Sort is a deliberately inefficient comparison-sorting algorithm. It is famous because its implementation is short, its recursive structure is unusual,…
A blog engine is a useful project for learning how a web application works from request to database and back again. Django provides the application framework,…
Imagine standing on the Cahill Expressway lookout in Sydney, watching the blue of the harbour squeeze between two piers. The wider the gap and the deeper the…
Unsupervised learning often leaves practitioners staring at scatter plots, trying to find structure that may or may not exist. Among the family of clustering…
A segment tree is one of the most versatile data structures in a programmer's toolkit, especially when handling interval-based operations on arrays. It allows…
When you press Ctrl+F in a document or search for a name inside a million-line log file, an algorithm has to decide where the needle sits in the haystack.…
When you first start working with arrays in NumPy, it's tempting to reach for a Python loop for almost every operation. The thing is, NumPy is built to…