Algorithms MergeSort in F# Tim Roughgarden says that MergeSort is a canonical example of a divide-and-conquer algorithm: you want to sort an array of numbers? Split it into two smaller arrays, sort each one, and then merge the partial results. This graph from Algorithms Illuminated Part 1 illustrates the process: The high-level pseudo-code for
F# Algorithms Illuminated: Karatsuba multiplication 2/2 The second and final part of the posts explaining our functional implementation of Karatsuba fast multiplication algorithm.
F# Algorithms Illuminated in F#, the beginning Implementing the Karatsuba fast multiplication algorithm in F#
F# Functional argument checking Using the railway pattern for validating function call arguments in F#
