Unanswered Questions
417 questions with no upvoted or accepted answers
23
votes
0
answers
668
views
Multiplying big numbers using Karatsuba's method
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 (...
- 4,773
9
votes
1
answer
386
views
Metropolis Monte Carlo Sampler in Rust
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 ...
CommunityBot
- 1
8
votes
0
answers
431
views
Engineering an even faster qsort
I understand that C++ STL template sort runs faster than qsort in C because ...
- 1,080
8
votes
0
answers
179
views
Implementing Simple Diff in Rebol
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 ...
- 489
7
votes
0
answers
253
views
Error handling function (Win32/C)
I have written the following function to be a general "error logging" solution for my Windows API projects. Basically, given a Windows system error code (a la ...
CommunityBot
- 1
7
votes
0
answers
541
views
Bidirectional bijective hash map in C
I have this bidirectional hash map in C for dealing with bijective maps. Each key mapping consists of a primary key and a secondary key, and I can ask the data structure to give me a secondary key ...
- 30.2k
7
votes
0
answers
546
views
A* Algorithm in F#
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 ...
CommunityBot
- 1
7
votes
0
answers
569
views
Red-black tree appears to be slower than std::multimap
I've written a red-black tree in C as an exercise. The tree works and it is not bad, but it is about 10% slower than std::multimap from libstdc++ which I'm ...
- 145k
6
votes
0
answers
107
views
Chapter 8 Challenge: Add employee names to a department
The boring but exciting challenge:
Using a HashMap and HashSet, create a text interface to allow a user to add employee names ...
- 85k
6
votes
0
answers
167
views
Efficiently generate distinct subsets which sum to a particular value
Related: Find all distinct subsets that sum to a given number
This code is supposed to efficiently generate all subsets of a list such that the subset's values sum to a particular target value. For ...
- 161
6
votes
0
answers
122
views
K nearest neighbours algorithm
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 ...
- 145k
6
votes
0
answers
271
views
Selection sort with reduced comparison count: Python iteration 2
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 ...
- 7,209
6
votes
0
answers
709
views
Simple virtual machine prototype for Lisp-style languages
I found a post I made here an year ago (Compiler for a minimal LISP dialect to run on the Java Virtual Machine) and got interested on this subject again. This time I decided to implement the ...
CommunityBot
- 1
6
votes
0
answers
2k
views
Generic sliding window
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 ...
CommunityBot
- 1
6
votes
0
answers
643
views
Fowler–Noll–Vo hash function in Lua
I recently coded this FNV-1a hash function in Lua. Are there any apparent performance improvements that could be implemented?
...
CommunityBot
- 1