Here are all the tags available on this blog.
Wednesday, 10 June 2015
Thursday, 3 September 2015
Functional programming is seeing an increase in popularity, as can be seen in rising adoption of languages like Scala, Clojure and Erlang. Even Java has introduced lambdas (more about lambdas, later).
Tuesday, 8 September 2015
We will now look at another functional technique, known as currying, which builds on those concepts.
Saturday, 12 September 2015
Monday, 14 September 2015
One area this applies to is in the large number of function calls resulting from this approach — particularly when we are writing recursive code.
We will give an example of this problem — calculating Fibonacci numbers — and then look at a technique known as memoization as a way of improving performance.
Building a Graph in Clojure, for the Kiwiland Railway
Tuesday, 9 April 2019
I was recently looking at a programming test, where the challenge is to represent a railway system (called “Kiwiland”) and then deduce various facts about it (for example the distance for a certain route). I wanted to develop this in Clojure, and thought it would be an interesting thing to work through on my blog.
Breadth First Graph Traversal in Clojure (Kiwiland Example)
Saturday, 11 May 2019
In my previous article, I looked at how to create a graph in Clojure, and find the length of various journeys within it. I will now move on to look at how to search the graph, to solve some of the other questions in the Kiwiland Trains Programming Challenge. This will focus primarily on the implementation of a breadth first search.