Cogito Ergo Fun
  • Home
  • About
  • Collection
  • Author
  • Portal
Subscribe
Tagged

Functional programming

A collection of 4 posts

MergeSort in F#
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

  • Édgar Sánchez Gordón
Édgar Sánchez Gordón Jan 4, 2022 • 3 min read
Algorithms Illuminated: Karatsuba multiplication 2/2
F#

Algorithms Illuminated: Karatsuba multiplication 2/2

The second and final part of the posts explaining our functional implementation of Karatsuba fast multiplication algorithm.

  • Édgar Sánchez Gordón
Édgar Sánchez Gordón Dec 23, 2021 • 4 min read
Algorithms Illuminated in F#, the beginning
F#

Algorithms Illuminated in F#, the beginning

Implementing the Karatsuba fast multiplication algorithm in F#

  • Édgar Sánchez Gordón
Édgar Sánchez Gordón Dec 20, 2021 • 6 min read
Functional argument checking
F#

Functional argument checking

Using the railway pattern for validating function call arguments in F#

  • Édgar Sánchez Gordón
Édgar Sánchez Gordón Dec 15, 2021 • 4 min read
Cogito Ergo Fun © 2022
  • Data & privacy
  • Contact
  • Contribute →
Powered by Ghost