The Karatsuba algorithm, first published in 1962, aims to speed up the multiplication of big numbers by reducing the number of 'single-digit-multiplications' involved.Because of its complexity (...

For anyone reading this old question, this module has evolved and improved a lot since then. It has been fully rewritten in C# and uploaded to the PowerShell Gallery! If you would like to try it out:<...

the following is an implementation of the standard Metropolis Hastings Monte Carlo sampler. You can read more about it here.At the end I am going to give you a link to the Rust playground, so you ...

I've taken a crack at implementing Simple Diff in Rebol (versions 2 and 3). Simple Diff works by finding the longest common sequence in two series, then recursively applies itself either side of this ...

I've created this database structure to store tabular information (it's a simplification of my real structure but enough to show the point). In it I haveSheets and ...

Follow up to Selection sort with reduced comparison count - semi-final Iteration?My goal (and excuse not to tag reinventing…) is to have presentable code to argue the viability of reducing the number ...

Inspired by this post I looked up A* on wikipedia and went on with my own implementation as seen below where I try to mimic the pseudocode on Wikipedia but in a recursive manner. I would like any ...

Related: Find all distinct subsets that sum to a given numberThis code is supposed to efficiently generate all subsets of a list such that the subset's values sum to a particular target value. For ...

Here is a project that I worked on for a few days in June 2020. Since the algorithm is extremely slow, I looked into methods in order to parallelize operations but did not obtain any satisfactory ...

Because my original question was lacking many details, I have been advised to ask a new question.I will repeat the important parts of the original question and add examples etc to hopefully make it ...

I created a small-ish NodeJS script which takes as argument the name of a Wikipedia article (and optionally a Wikipedia edition, "en" is default) and creates a Git repository with each ...

The code implements fully generic sliding window with linear complexity. It should usually be paired with transforming iterator to reach full potential.Sliding window is a grouping of elements by ...

I recently coded this FNV-1a hash function in Lua. Are there any apparent performance improvements that could be implemented?...

Counterfactual Regret Minimization is an algorithm that can be used to find the Nash Equilibrium for games of incomplete information. I have tried to adapt the exercise from here to Clojure. You can ...

I recently learned Haskell, and I am trying to apply it to the code I use in order to get a feeling for the language.I really like the Repa library since I manipulate a lot of multi-dimensional data....