FizzBuzz is FizzBuzz years old (and still a powerful tool)
This year marks 15 years since FizzBuzz was popularised as an interview tool for developers. I’m a big fan and have watched over 100 candidates try their hand at my version of the task. In today’s blog post I’d like to take a moment to celebrate what makes FizzBuzz so helpful, discuss some common patterns I’ve observed in the many attempts I’ve witnessed, and finally explore some tweaks that can b
Why does this code execute more slowly after strength-reducing multiplications to loop-carried additions?
I was reading Agner Fog's optimization manuals, and I came across this example: double data[LEN]; void compute() { const double A = 1.1, B = 2.2, C = 3.3; int i; for(i=0; i<LEN; i++) { data[i] = A*i*i + B*i + C; } } Agner indicates that there's a way to optimize this code - by realizing that the loop can avoid using costly multiplications, and instead use the "deltas" that are applied per iteratio
Spaghetti sort - Wikipedia
This article may be confusing or unclear to readers. Please help clarify the article. There might be a discussion about this on the talk page. (July 2013) (Learn how and when to remove this message) Schematic diagram of spaghetti sorting. The spaghetti can be sorted by removing them from the bundle on the table in the order they stick out. Spaghetti sort is a linear-time, analog algorithm for sort
GitHub - labuladong/fucking-algorithm at english
English translation is in progress... Some articles are still in Chinese, but most are completed. Please star this repo. The full translation will eventually be finished. Enjoy. These articles go over different kinds of Algorithmic Thinking. All are based on LeetCode problems. They contain not just the solution code for a problem, but also WHY the solution works and HOW you too can figure it out.
AlgorithmWatch
AlgorithmWatch is a human rights organization based in Berlin and Zurich. We fight for a world where algorithms and Artificial Intelligence (AI) do not weaken justice, democracy, and sustainability but strengthen them. Italy introduces entirely automated public tendersThe neofascist government led by Brothers of Italy passed a law that encourages public institutions to entirely automate procuremen
How can I pair socks from a pile efficiently?
Yesterday I was pairing the socks from the clean laundry and figured out the way I was doing it is not very efficient. I was doing a naive search — picking one sock and "iterating" the pile in order to find its pair. This requires iterating over n/2 * n/4 = n2/8 socks on average. As a computer scientist I was thinking what I could do? Sorting (according to size/color/...) of course came to mind to
Linear Programming with Kotlin Part III - Generating Multi-day Schedules
In Part I of this series I introduced binary programming with Kotlin and ojAlgo. In Part II, I introduced continuous variables and optimization concepts. In this section, I am going to present something more ambitious and useful: generating multi-day schedules. This can be applied to scheduling problems such as staffing, manufacturing, transportation, classroom allocation, and even sport event pla
IEEE Big Data is back again this December - Startup ML
IEEE Big Data is a conference that focuses on the latest developments and advances in the field of big data. The conference brings together researchers, practitioners, and industry experts to share their knowledge and expertise, and to discuss the latest trends and challenges in the field. The conference also forms part of a larger umbrella initiative, namely the IEEE Future Directions Big Data In
Sorting Algorithms Animations
KEY Black values are sorted. Gray values are unsorted. A red triangle marks the algorithm position. Dark gray values denote the current interval (shell, merge, quick). A pair of red triangles marks the left and right pointers (quick). DISCUSSIONThese pages show 8 different sorting algorithms on 4 different initial conditions. These visualizations are intended to: Show how each algorithm operates.
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Open secrets about Hacker News
GitHub - minimaxir/hacker-news-undocumented: Some of the hidden norms about Hacker News not otherwise covered in the Guidelines and the FAQ.
Show HN: Second-Chance Pool | Hacker News
GitHub - TheAlgorithms/Rust: All Algorithms implemented in Rust
Removing characters from strings faster with AVX-512 – Daniel Lemire's blog
GitHub - twitter/the-algorithm: Source code for Twitter's Recommendation Algorithm
botfights.ai
Solving Wordle in 3.64 Guesses on Average, 99.4% of the Time
What3Words – The Algorithm
Sudokus and Schedules
Dennis Yurichev: [Python] Cracking Minesweeper by bruteforce