Jakob Kogler

Usually when I require quick factorizations of reasonable small numbers (lets say $< 10^7$), I've just performed a normal sieve of Eratosthenes, but instead of storing true/false values, I've stored...

@Vanraj8169 Most of our code snippets are in C++, but I don't mind Java as well. Especially my approach (see my last comment) should me mentioned on the [Integer factorization](https://cp-algorithms.com/algebra/factorization.html)...

Did you understand the algorithm correctly? It is indeed logarithmic in `n+m`. E.g. ``` >>> find(34, 53) find(x=34, y=53, a=0, b=1, c=1, d=0) find(x=34, y=53, a=0, b=1, c=1, d=1) find(x=34,...

@Aeren1564 My bad. I was completely wrong here. I remember using a faster version in a contest once, and I was pretty sure that I copied it from here. But...

I've fixed a couple of the links. For the GCJ problems: Google stopped doing the contest, but they published all historical problems here: https://github.com/google/coding-competitions-archive For the DevSkills problems: You can...

Sure, could be useful.

> If there's only three possible values, then you could also just count how many of each element there are and make another pass to build the sorted array? @jxu...

@jxu I did, it was something like this:  The dutch algorithm is very cache efficient.

@shimmer12 You should still explain a bit, where the pointers point to. Just copy-pasting that formula doesn't explain what the pointers are actually doing. Something like that: > I would...

**Upfront about me:** As you can see from the time it took me to reply, I'm not focusing on this project any more. I still host the project, and from...