Tag: #haskell

An algorithm in Haskell using a breadth-first search to find the reachable set of nodes. 2020-01-24

An O(n) algorithm to check if a binary tree is balanced, by passing up the height from recursive calls. 2020-01-23

We can model “infinite tape” using two stacks. Then we can navigate the list in both directions. This lets us bubble-sort the list in O(n^2) time. 2020-01-22

Implement a queue using two stacks, with one stack for the back of the queue and one for the front. Reverse the back stack onto the front stack when dequeuing to maintain the queue order. 2020-01-21

A Haskell solution to the classic Towers of Hanoi problem. 2020-01-20

Find the middle node of the linked list using the “runner” trick. Reverse the first half, then compare the nodes pairwise from the middle outwards. Restore the list to its original state before returning. 2020-01-16

I write a parser for JimScript, an imperative programming language, in Haskell. The parser goes through three stages: tokenization, nesting, and parsing. 2018-03-09

An interpreter for an imperative language in Haskell, featuring integers, operators, global variables, control flow, and I/O primitives. 2018-03-06

Large working sets and low latency are incompatible with GHC’s stop-the-world garbage collector, which optimizes for throughput instead of latency. The collector’s pause times scale linearly with working set size. 2016-05-12

A visual programming language inspired by Haskell. 2012-02-27