Algorithms drawn as IKEA furniture instructions | FlowingData

8 days ago by jchris

Learning algorithm steps can be a challenge when viewed only through code or words. So Sándor P. Fekete, Sebastian Morr, and Sebastian Stiller put together IDEA. The collection of illustrations describes common programming algorithms, such as Quicksort, in the style of IKEA furniture assembly instructions. Allen wrench not required. [via kottke]

algorithm
graphics
8 days ago by jchris

https://weaponsofmathdestructionbook.com

january 2018 by jchris

A former Wall Street quant sounds an alarm on the mathematical models that pervade modern life — and threaten to rip apart our social fabric. [...] We live in the age of the algorithm. Increasingly, the decisions that affect our lives—where we go to school, whether we get a car loan, how much we pay for health insurance—are being made not by humans, but by mathematical models. In theory, this should lead to greater fairness: Everyone is judged according to the same rules, and bias is eliminated.

biblio
algorithm
math
january 2018 by jchris

Buckblog: Maze Generation: Eller's Algorithm

january 2018 by jchris

Last time I talked about the recursive backtracker algorithm for maze generation. That’s probably always going to be my favorite algorithm for generating mazes, for a variety of reasons, but that’s not going to stop me from looking at others.

algorithm
maze
programming
january 2018 by jchris

Social Network Post Scoring Systems and Their Consequences

august 2017 by jchris

Q: what happens when you are so successful that most or all the people use it?

A: You get plebeianism. That is, the top valued articles/posts will become those liked by the masses, the things you see everyday in ads, on TV, absolutely devoid of quality. (the likes of cat pictures, or crowd-pleasing commercials)

algorithm
scoring
social-media
xah
A: You get plebeianism. That is, the top valued articles/posts will become those liked by the masses, the things you see everyday in ads, on TV, absolutely devoid of quality. (the likes of cat pictures, or crowd-pleasing commercials)

august 2017 by jchris

Block TEA ‘Tiny Encryption Algorithm’ (xxtea) implemented in JavaScript

february 2016 by jchris

Wheeler & Needham’s Tiny Encryption Algorithm is a simple but powerful encryption algorithm (based on a ‘Feistel cipher’). -==- This is a JavaScript implementation of the (corrected) ‘Block TEA’ or ‘large block’ version of the algorithm (also dubbed ‘xxtea’) with a wrapper to enable it to work on (Unicode) text strings.

algorithm
encryption
javascript
security
february 2016 by jchris

Data Structures and Algorithms with Object-Oriented Design Patterns in Java

april 2012 by jchris

Graph Traversal Applications: Testing for Cycles and Connectedness -=- This section presents several graph algorithms that are based on graph traversals. The first two algorithms test undirected and directed graphs for connectedness. Both algorithms are implemented using the depth-first traversal. The third algorithm tests a directed graph for cycles. It is implemented using a topological-order traversal.

algorithm
graph
java
ebook
programming
april 2012 by jchris

EnRUPT – The Simpler The Better

june 2008 by jchris

EnRUPT is a simple scalable all-in-one block/stream cipher/hash.

encryption
algorithm
june 2008 by jchris

Maze generation algorithm

january 2008 by jchris

There are a number of different maze generation algorithms, that is, automated methods for the creation of mazes.

algorithm
maze
reference
wikipedia
january 2008 by jchris

A* Pathfinding for Beginners

january 2008 by jchris

The A* (pronounced A-star) algorithm can be complicated for beginners.

While there are many articles on the web that explain A*, most are

written for people who understand the basics already. This article is

for the true beginner.

AI
algorithm
article
maze
programming
tutorial
While there are many articles on the web that explain A*, most are

written for people who understand the basics already. This article is

for the true beginner.

january 2008 by jchris

Counting Number of On Bits in an Integer

december 2007 by jchris

Fast Bit Counting Routines -=- Compiled from various sources by Gurmeet Singh Manku -=- A common problem asked in job interviews is to count the number of bits that are on in an unsigned integer. Here are seven solutions to this problem. Source code in C

algorithm
programming
optimization
m:lotto
december 2007 by jchris

Gato: Graph Animation Toolbox

november 2007 by jchris

Gato - the Graph Animation Toolbox - is a software which visualizes algorithms on graphs. Graphs are mathematical objects consisting of vertices and edges connecting pairs of vertices: think of cities as vertices and interstates as edges connecting two ci

algorithm
animation
graph
programming
visualization
november 2007 by jchris

Damn Cool Algorithms, Part 1: BK-Trees - Nick's blog

april 2007 by jchris

BK-Trees, or Burkhard-Keller Trees are a tree-based data structure

engineered for quickly finding near-matches to a string, for example,

as used by a spelling checker, or when doing a 'fuzzy' search for a

term. The aim is to return, for example, "seek" an

algorithm
programming
tree
agrep
levenshtein
metric
soundex
engineered for quickly finding near-matches to a string, for example,

as used by a spelling checker, or when doing a 'fuzzy' search for a

term. The aim is to return, for example, "seek" an

april 2007 by jchris

Splay Tree Demo

may 2006 by jchris

Splay trees, or self-adjusting search trees are a simple and efficient data structure for storing an ordered set. The data structure consists of a binary tree, with no additional fields. It allows searching, insertion, deletion, deletemin, deletemax, spli

algorithm
java
tree
animation
may 2006 by jchris

Pragmatic Parsing in Common Lisp -- ACM Lisp Pointers 4, 2 (Apr/Jun 1991), 3-15.

april 2006 by jchris

We review META, a classic technique for building recursive descent parsers, that is both simple and efficient. While META does not handle all possible regular or context-free grammars, it handles a surprisingly large fraction of the grammars encountered b

@goodie
@toread
article
algorithm
coding
lisp
paper
parser
henry-baker
april 2006 by jchris

Memorable Random Strings

april 2006 by jchris

Memorable Random Strings As URIs -- Are random string really all that bad? For example, a seven character alphanumeric string would have 36^7 = about 78 billion combinations! A five character string would be 36^5 = 60 million. Surly a five character rando

algorithm
koremutake
MeRS
april 2006 by jchris

**related tags**

Copy this bookmark: