Life & fun · alternatives · 2026
24 alternatives to Big-O Poster [pdf]
Big-O Complexities / Poster of common algorithms used in Computer Science - bigoposter/bigoposter.pdf at master · ro31337/bigoposter
Big-O Poster is a PDF reference guide for computer science students and programmers learning algorithm complexity. It visualizes Big-O notation and time complexity comparisons in an easy-to-reference format. The poster… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. Big-O Poster [pdf] launched in 2016; newer entries below may have overtaken it.
- 1
Visual explanations of Algorithms and Data structures
2020 · chrislaux.com · its alternatives →
- 2
🥞Data Structures and Algorithms explained and implemented in JavaScript + eBook - amejiarosario/dsa.js-data-structures-algorithms-javascript
2019 · github.com · its alternatives →
- 3
DeepSeek-OCR▲350Advanced visual-text compression technology
2025 · huggingface.co · its alternatives →
- 4IQ
A propos de Mastalab
2017 · illustrated-algorithms.now.sh · its alternatives →
- 5GPGo Plan9 Memo▲305
A quick dive into the Plan9 assembly I picked up while developing my SIMD package for Go, and how it led to a 450% performance boost in calculations.
2024 · pehringer.info · its alternatives →
- 6CA
2017 · billsix.github.io · its alternatives →
- 7
Heap based scheme machine. GitHub Gist: instantly share code, notes, and snippets.
2025 · gist.github.com · its alternatives →
- 8
Hi HN, We've discussed the Unix Magic poster before (https://news.ycombinator.com/item?id=27029196). Like many of you, I love this poster and all the Unix references hidden in it. I built this as a static site that lets us annotate the Unix Magic poster by placing markers on references and adding descriptions to explain them. I've added a few so far, but there's much more to document. What I love about this approach is that contributions happen not just on the site itself but also through PRs, where we can discuss and refine the details of each reference. Feel free to send a…
2025 · drio.github.io · its alternatives →
- 9
I started writing this book 10 years ago in JavaScript, got through a few chapters (asymptotic notation, basic techniques, start of sorting), and then abandoned it. Recently I picked it back up, converted everything to TypeScript, and used AI (Zenflow [1] + Claude Opus 4.6) to complete the remaining chapters. I provided the structure, direction, and initial chapters; the AI generated the bulk of the remaining content under a spec-driven workflow. The book covers roughly a first 1-2 year CS curriculum: sorting, dynamic programming, graph algorithms, trees, heaps, hash tables, and more. All…
Mar 2026 · amoilanen.github.io · its alternatives →
- 10BB
2019 · boat.algorithm.city · its alternatives →
- 11
I've developed a Python API service that uses GPT-4o for OCR on PDFs. It features parallel processing and batch handling for improved performance. Not only does it convert PDF to markdown, but it also describes the images within the PDF using captions like `[Image: This picture shows 4 people waving]`. In testing with NASA's Apollo 17 flight documents, it successfully converted complex, multi-oriented pages into well-structured Markdown. The project is open-source and available on GitHub. Feedback is welcome.
2024 · github.com · its alternatives →
- 12
Hey HN, I don’t know who else has the same issue, but: Textbooks often bury good ideas in dense notation, skip the intuition, assume you already know half the material, and get outdated in fast-moving fields like AI. Over the past 7 years of my AI/ML experience, I filled notebooks with intuition-first, real-world context, no hand-waving explanations of maths, computing and AI concepts. In 2024, a few friends used these notes to prep for interviews at DeepMind, OpenAI, Nvidia etc. They all got in and currently perform well in their roles. So I'm sharing. This is an open & unconventional…
Feb 2026 · github.com · its alternatives →
- 13OS
2019 · partow.net · its alternatives →
- 14
Creating high-quality scientific figures can be time-consuming and challenging, even though sketching ideas on paper is relatively easy. Furthermore, recreating existing figures that are not stored in formats preserving semantic information is equally complex. To tackle this problem, we introduce DeTikZify, a novel multimodal language model that automatically synthesizes scientific figures as semantics-preserving TikZ graphics programs based on sketches and existing figures. We also introduce a Monte Carlo Tree Search-based inference algorithm that enables DeTikZify to iteratively refine its…
2024 · github.com · its alternatives →
- 15
🥞Data Structures and Algorithms explained and implemented in JavaScript + eBook - amejiarosario/dsa.js-data-structures-algorithms-javascript
2019 · github.com · its alternatives →
- 16
Everything that would be here is in the README. I hope this gets big, it has tons of potential.
2013 · github.com · its alternatives →
- 17
Interactive solver for the traveling salesman problem to visualize different algorithms. Includes various Heuristic and Exhaustive algorithms.
2019 · tspvis.com · its alternatives →
- 18
Directed acyclic graphs are muched discussed in comp-sci, but octopus appears to be the first reusable, turnkey, ready-to-wear, off-the-shelf implementation of a DAG for application development, in any language, that I'm aware of. This is remarkable because DAGs hit a sweet spot in the middle of the three common programming paradigms (OO, event-driven, functional). Let's have a DAG as the top-level structure of our applications. Data-fetching and onChange handlers live in DAG nodes, next to the data they act on. The UI flows out from the DAG with fine-grained reactivity. Our app state is…
2023 · github.com · its alternatives →
- 19
An illustrated guide for programmers & other curious people
2016 · adit.io · its alternatives →
- 20
Broad span of algorithms, covered in clear depth
2015 · amazon.com · its alternatives →
- 21
Problem Solving. Contribute to sangupta/ps development by creating an account on GitHub.
2016 · github.com · its alternatives →
- 22
Contribute to sendilkumarn/gopurerc development by creating an account on GitHub.
2020 · github.com · its alternatives →
- 23
Visual explanation of pathfinding algorithms and how a*, Dijkstra and BFS can be seen as the same algorithm with different parameter/data structures used under the hood - npretto/pathfinding
2021 · github.com · its alternatives →
- 24
This repository contains the pseudocode(pdf) of various algorithms and data structures necessary for Interview Preparation and Competitive Coding - Just-A-Visitor/Algorithmic-Pseudocode
2019 · github.com · its alternatives →
Also compare
Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →