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 (...

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 ...

PrefaceI have decided to let my pet project created some years ago to undergo a code review here. The review will be broken into parts according to meta question Multiple reviews or one big review?...

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 ...

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 ...

NOTE: this question isn't as long as it appears to be. I added the comments to the code only to answer some possible questions that may appear.I'm making an active time battle strategy. Its mechanics ...

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 did a quick take-home test for a potential job opportunity. It included building a GraphQL API with nodeJS. I am not an expert in node (mostly use Python at work) but I have used it for ...

I have multiple tables and multiple email templates which will need tags replacing. The data for the tags depends on the recipient id as the data will need to be fetched from different tables.I have ...