Movatterモバイル変換


[0]ホーム

URL:


Sorry, we no longer support your browser
Please upgrade toMicrosoft Edge,Google Chrome, orFirefox. Learn more about ourbrowser support.
Skip to main content

Stack Exchange Network

Stack Exchange network consists of 183 Q&A communities includingStack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange
Loading…
Code Review

Unanswered Questions

Ask Question
717 questions with no upvoted or accepted answers
23votes
0answers
761views

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 (...
16votes
0answers
3kviews

Realtime concurrent Haskell MIDI buffer

Problem BackgroundMIDI is a serial representation of control signals to a sound generator. Typically, a noteOn message initiates the attack phase of a sound at a given pitch. The note will ...
15votes
0answers
283views

Download files in parallel

This module has aensure_downloaded function which takes a slice ofUrls. It downloads all of the urls to a local downloads ...
10votes
0answers
800views

Sieve32FastV2 - A fast parallel Sieve of Eratosthenes

I’ve created a much cleaner, better designed version to my parallel sieve. I’ve implemented most of EBrown’s micro-optimizations but also revamped the code on my own (that is not in direct response ...
9votes
1answer
418views

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 ...
8votes
0answers
201views

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 ...
7votes
0answers
293views

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 ...
7votes
0answers
564views

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 ...
6votes
0answers
185views

Efficiently generate distinct subsets which sum to a particular value

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 ...
6votes
0answers
147views

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 ...
6votes
0answers
9kviews

Example of multithreading in Python3 / PyQt5 using QThread

I wanted to make a simple example of multithreading with QThread in PyQt5 / Python3. The script generates a set ofQLineEdits and buttons to start and stop a set of ...
6votes
0answers
145views

Android component animatable on its height

I'd like to have a code review for a component which is supposed to be animatable on its height. It's supposed to be a transitioning element.I find it quite laggy on my phone....
6votes
0answers
2kviews

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 ...
6votes
0answers
827views

Pseudo-parallel depth-first search

I'm writing a small program that generates a file containing an adjancency matrix, it then reads from that file, constructs a graph and does something like a parallel depth-first search (dfs) on it....
6votes
0answers
2kviews

Implement two level caching using spring's cache abstraction Cache and CacheManager

Details about spring's caching framework are here. When I was reading this link, I thought the composite cache mentioned there was one that used levels of caching based on the order given to the ...

153050per page
1
2345
48

Unanswered Tags

performance × 89
python × 80
android × 57
c++ × 55
graph × 38
swing × 31
c# × 30
javascript × 30
spring × 29
beginner × 27
python-3.x × 27
concurrency × 27
object-oriented × 26
javafx × 24
tree × 22
thread-safety × 21
rust × 20
programming-challenge × 19
sorting × 18
pathfinding × 18
design-patterns × 16
game × 15
recursion × 15
comparative-review × 14
c++11 × 13
more related tags

[8]ページ先頭

©2009-2025 Movatter.jp