The Ben Paul Thurston Blog

First you have the triangular numbers: T(i) = 0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55 Then the square numbers both indexed with the first n...

For example: In general the coefficient should be the nth power of 2  and the recursive square root has log_2(n) 2's when it...

First you have a set of points that make lines like so: This represents the line from (x1, y1) to (x2, y2) and we give it an initial valu...

I noticed: Where V is the number of vertices, E is the number of edges, X is the number of times a line crosses one or more other lines...

This wikipedia article gives a pretty good introduction to the topic: https://en.wikipedia.org/wiki/Sorting_network The above is a ve...

Suppose you have a message m that is in an alphabet with n symbols indexed as x symbols... H e l l o ,   t h i  s     i  s     t  h  e    ...

The above is a sorting network for 16 items that I haven't yet proven works every time; but it correctly sorted many random lists c...