The Ben Paul Thurston Blog

It's known that the optimal sorting network for 16 entries as described here: http://en.wikipedia.org/wiki/Sorting_network will be be...

Suppose you have a polygon, possibly concave, like so: I found an algorithm that works for telling whether a point is inside the polygon ...

This sort starts with the list of items: [13, 8, 10, 18, 0, 4, 2, 11, 12, 14, 7, 19, 1, 3, 17, 6, 15, 5, 9, 16] Starting it takes the last...

Supposing we have a list of 20 items to be sorted, here I'll just use the numbers 0-19: [13, 8, 10, 18, 0, 4, 2, 11, 12, 14, 7, 19, 1, ...

I was wondering if it were possible to make a single simple character for every word in the English language, which is around 100,000 words ...

I wanted to go more in depth on the previous idea on the blog but I have to coin some terms to be able to write about it as I don't know...

I noticed you can take an uncolored map like: You can set up a set of equations to solve for, as follows... if region X is next to regi...