Binary GCD Algorithm: A Faster Alternative to Standard Euclidean Algorithm
In this section, we will derive a variant of gcd that is ~2x faster than the one in the C++ standard library.
Read the full articleYou might also wanna read
Binary Search in Python: Iterative Implementation Using a While Loop
🚀 Day 52/150 – Binary Search in Python
ACM Transactions on Mathematical Software (toms) Vol 52, Issue 2
cacm.acm.org
Placing 5th in the GPU MODE QR Decomposition Competition: Optimization Techniques and Lessons Learned
How I placed 5th in the GPU MODE qr_v2 competition with common sense engineering, linear algebra tricks, an agent swarm, and a dream.
ml-mike.com·9d ago
Achieving 232x Speedup on GPU QR Factorization: A Contest Retrospective
Table of Contents Intro Contest in short Problem intro Why this problem is auto-research-able Learning Enough to Ask Better Questions (Optio
How we made ingestion 30% faster with C++ (not Rust, sorry)
Improved RowBinary conversion speeds up ingestion significantly. Less CPU overhead, faster data loading. Here's what we optimized.
Tinybird·1y ago
How Pattern Recognition Transforms Slow Code into Efficient Solutions
A software developer on DEV Community illustrates how recognizing algorithmic patterns can dramatically improve coding performance. Using th
ShortSingh·1d ago

Comments
Sign in to join the conversation.
No comments yet. Be the first.