Links tagged “algorithms”
21 links, newest first.
john.fun
How elevator dispatch algorithms work, from the simple LOOK approach to the destination-dispatch systems that cut waiting.
medium.com
An implementation walkthrough of the Chord distributed hash table in Go, covering consistent hashing, lookups, node joins and the stabilisation protocol.
zalo.github.io
An interactive walkthrough of constraint solving as projection, from distance constraints and FABRIK to collisions, Verlet integration and soft bodies.
just-taking-a-ride.com
An animated explanation of how CPython's dict works, built up from linear search through hash tables and linear probing, running on data you type in.
github.com
A pure-Python consistent hashing ring, ketama-compatible, with per-node weights and pluggable hash functions.
peterbe.com
Benchmarks several ways to remove duplicates from a Python list, and finds list(dict.fromkeys(seq)) fastest when insertion order must be preserved.
rob-bell.net
Plain-language introduction to Big O notation, walking through O(1), O(N), O(N²), O(2^N) and O(log N) with a short code example for each.
wiki.python.org
Reference table of the time complexity of CPython operations on lists, deques, sets and dictionaries.
rosettacode.org
A programming chrestomathy wiki presenting solutions to the same task in as many different languages as possible, to show how each one expresses it.
github.com
Educational Python library implementing classic algorithms and data structures, now archived.
en.wikipedia.org
Wikipedia article on record linkage — matching records that refer to the same entity across separate data sources, and the deterministic and probabilistic methods used to do it.
networkx.readthedocs.io
Documentation for NetworkX, the Python library for creating, manipulating and studying graphs and networks.
python.org
An essay on representing graphs with plain Python dictionaries and lists, with code for finding a path and the shortest path between two nodes.
igvita.com
Builds a blockchain from first principles, showing how digital signatures, proof of work and the longest-chain rule settle transactions without a trusted third party.
smashingmagazine.com
An introduction to procedural content generation through WorldEngine, an open-source generator that simulates plate tectonics, erosion and climate to build whole planets.
interviewcake.com
An explanation of big O notation — dropping constants and lower-order terms, worst-case analysis, and space complexity — illustrated with Python.
catonmat.net
I decided to write an article about a thing that is second nature to embedded systems programmers - low level bit hacks. Bit hacks are ingenious little programming tricks that manipulate integers in a smart and efficient manner. Instead of performing some operation (such as counting the 1 bits in ...
acm.timus.ru
Problem set of the Timus Online Judge, over 1,200 competitive-programming problems browsable by difficulty, topic and originating contest, with online submission.
fr.wikipedia.org
Wikipedia article on the 21 combinatorics and graph-theory problems Richard Karp showed in 1972 to be NP-complete by reduction to one another.
