Tag Archives: data

Data structure challenge: application

Posted on April 6, 2020 by Brent

I forgot to mention this in my previous post, but the thing which got me thinking about the predecessor problem in the first place was this competitive programming problem on Open Kattis: Profitable Pizzas I challenge you to go and … Continue reading →

Posted in data structures | Tagged , , , , , , , , , , , , , , | Leave a comment

Data structure challenge: solutions

Posted on April 6, 2020 by Brent

In my previous post I challenged you to find a way to keep track of a sequence of slots in such a way that we can quickly (in or better) either mark any empty slot as full, or find the … Continue reading →

Posted in data structures | Tagged , , , , , , , , , , , , | 3 Comments

Data structure challenge: finding the rightmost empty slot

Posted on March 23, 2020 by Brent

Suppose we have a sequence of slots indexed from 1 to . Each slot can be either empty or full, and all start out empty. We want to repeatedly do the following operation: Given an index , find the rightmost … Continue reading →

Posted in data structures | Tagged , , , , , , , | 16 Comments

Lightweight invertible enumerations in Haskell

Posted on July 5, 2019 by Brent

In a previous post I introduced a new Haskell library for enumerations (now on Hackage as simple-enumeration). The Data.Enumeration module defines a type Enumeration a, represented simply by a function Integer -> a which picks out the value of type … Continue reading →

Posted in combinatorics, haskell, projects | Tagged , , , , , , | 2 Comments

Lightweight, efficiently sampleable enumerations in Haskell

Posted on May 14, 2019 by Brent

For another project I’m working on, I needed a way to enumerate and randomly sample values from various potentially infinite collections. There are plenty of packages in this space, but none of them quite fit my needs: universe (and related … Continue reading →

Posted in combinatorics, haskell, projects | Tagged , , , , | 11 Comments

In praise of Beeminder

Posted on May 17, 2016 by Brent

In January 2013, I wrote a post explaining my use of Beeminder, after using it for six months. Well, I’ve now been using it continuously for almost four years! It has become such an integral part of my life and … Continue reading →

Posted in meta | Tagged , , , | 5 Comments

In defense of drawing by coding

Posted on October 18, 2013 by Brent

Just some half-baked thoughts in repsonse to Bret Victor’s talk, Drawing Dynamic Visualizations (along with his addendum here). As usual, it is a fun and inspiring talk, so if you haven’t seen it I highly recommend it; but I will … Continue reading →

Posted in diagrams | Tagged , , , , , , , | 3 Comments

Beeminding for fun and profit

Posted on April 16, 2013 by Brent

I’ve been using Beeminder (which I’ve mentioned once before) for a little over six months now. The verdict? Beeminder has changed my life. That sounds dramatic, but I’m not kidding. I am far more productive than I’ve ever been. I’m … Continue reading →

Posted in grad school, meta | Tagged , , , | 23 Comments

Species subtraction made simple

Posted on November 24, 2010 by Brent

> {-# OPTIONS_GHC -fno-warn-missing-methods #-} > module Virtual where > > import Control.Applicative > import Test.QuickCheck Yesterday on #haskell, augur asked me to explain how subtraction works for combinatorial species. (For an introduction to species, see my paper from the … Continue reading →

Posted in combinatorics, haskell | Tagged , , , , , , , | 15 Comments