wtf is dsinjs?

This repo is a hands-on learning resource for understanding classic data structures and algorithms through JavaScript. It pairs written explanations with runnable, in-browser demos so you can see concepts like linked lists, stacks, binary search trees, and physics collision detection in action rather than just reading about them. The project is organized into two parts. The first is a set of articles (written in Chinese) that walk through how each data structure or algorithm works and where you might apply it. Topics include linked lists, stacks and recursion (with the Tower of Hanoi as an example), binary search trees, Newton's method for building an equation solver, and vector math for detecting collisions between circles and lines. The second part is a collection of interactive HTML5 demos hosted on JSFiddle. These let you play with a simple calculator, polynomial operations, a Tower of Hanoi visualization, a binary search tree tester, an auto-solver for equations, and collision detection tools, all running directly in your browser with no setup required. This would appeal to JavaScript learners who want to go beyond basic syntax and understand the building blocks that power more complex software. For example, if you are building a game and need to detect when a moving circle hits a wall, the collision demos show you the math and code. If you are curious how a calculator evaluates expressions or how an equation solver finds roots, those demos make the logic tangible. The README doesn't go into detail about installation or how the code is structured as a library, it is primarily a curated index of educational content and live demos rather than a tool you import into your own project. The focus is on teaching and visualizing, not providing a production-ready package.