Type OCaml
Well-typed programs cannot go wrong. - Robin Milner
  • Home
merge, pearls, algorithm, max, divide and conquer, surpassers

pear-2

Pearl No.2 - The Max Number of Surpassers

—  Published 20 February 2015  —

In a list of unsorted numbers (not necessarily distinct), such as The surpassers of an element are all elements whose indices…

Read Me
pearls, algorithm, min, selection, quickselect, min missing natural number

pears

Pearl No.1 - The Min Missing Natural Number

—  Published 02 February 2015  —

Prof. Richard Simpson Bird is a Supernumerary Fellow of Computation at Lincoln College, Oxford, England, and former director of t…

Read Me
functional programming style, quicksort , execution model , algorithm

immutable

Immutable

—  Published 02 January 2015  —

In pure functional programming, everything is immutable. Strings, lists, values of customised types etc cannot be changed once be…

Read Me
recursion, merge, mergesort, algorithm

recursion_reloaded

Recursion Reloaded

—  Published 04 December 2014  —

One essential of computer programming is repeating some operations. This repetition has two forms: for / while loop and recursion…

Read Me
Page 1 of 1