illustrated-algorithms - GitLite

KO | EN

gitlite — search

#react #ai #typescript #llm #go #android #machine-learning #linux #nodejs #java #pytorch #security #openai #open-source

illustrated-algorithms

(★ 2,762)

Interactive algorithm visualizations

파일 탐색기

최종 버전 다운로드 (.zip)

- .babelrc
- bfs.js
- binary-search.js
- quicksort.js
- - raw-data.js
- menu.js
- page.js
- playback-controls.js
- player.js
- source-code.js
- stack-entry.js
- - cosmos.test.js.snap
- - bg-color-proxy.js
  - context-proxy.js
  - frame-proxy.js
  - global-css-proxy.js
  - global-style-proxy.js
  - layout-proxy.js
- cosmos.config.js
- cosmos.proxies.js
- cosmos.test.js
- - quicksort.js
- base.js
- binary-search.js
- quicksort.js
- raw-data.js
- base.js
- bfs.js
- binary-search.js
- quicksort.js
- raw-data.js
- bfs.js
- binary-search.js
- index.js
- quicksort.js
- FiraCode-Light.woff
- - stack-recursive.js
  - stack-single.js
- cache.js
- names.js
- offset-steps.js
- pure-layout-component.js
- stack.js
- transition.js
- wobble.js
.babelrc
.gitignore
.prettierignore
.prettierrc
.travis.yml
binary-search.gif
CODE_OF_CONDUCT.md
CONTRIBUTING.md
ISSUE_TEMPLATE.md
jest.setup.js
LICENSE
next.config.js
package.json
README.md
yarn.lock

# 설치 가이드

1. 코드 내려받기

git clone https://github.com/ovidiuch/illustrated-algorithms

깃허브에서 프로젝트 코드 전체를 내 컴퓨터로 내려받습니다.

cd illustrated-algorithms

방금 내려받은 프로젝트 폴더 안으로 이동합니다.

2. Node.js

쉬움 추천

사전 준비물

Git GitHub에서 프로젝트 코드를 내려받으려면 필요합니다.
Node.js npm 명령어를 쓰려면 Node.js가 설치되어 있어야 합니다. LTS(장기지원) 버전을 추천합니다.

npm i

이 명령어를 터미널에 그대로 입력해 실행하세요.

npm run dev

개발/실행 서버를 켭니다.

npm test

이 명령어를 터미널에 그대로 입력해 실행하세요.

npm run cosmos

이 명령어를 터미널에 그대로 입력해 실행하세요.

✅ 명령어 실행 후 터미널에 나타나는 주소(보통 http://localhost:3000 형태)를 브라우저에서 열어보세요.

이 레포의 README에 적힌 실제 명령어를 그대로 가져왔습니다.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Illustrated Algorithms
Algorithm → AST → CSS (3 x JavaScript)

[![Binary search](https://raw.githubusercontent.com/ovidiuch/illustrated-algorithms/master/binary-search.gif)](https://illustrated-algorithms.now.sh/)

Inspired by [Grokking Algorithms](https://www.manning.com/books/grokking-algorithms) and [python-execution-trace](https://github.com/mihneadb/python-execution-trace), this project aims to reveal the mechanics behind algorithms via interactive visualizations of their execution.

Visual representations of variables and operations augment the control flow, alongside actual source code. You can fast forward and rewind the execution to closely observe how an algorithm works.

## Disclaimer ✌️

Edge cases and optimizations are beyond the scope of this project. The featured implementations are chosen for their simplicity and do not promise to work for data sets different from the illustrated ones. Please rely on other resources for learning algorithms in depth, from Wikipedia to other [visualization](https://visualgo.net/) [projects](https://www.youtube.com/watch?v=ywWBy6J5gz8). Also see community-driven [Footnotes](#footnotes). Thanks.

## Principles

- The same code that is displayed next to the illustration is also decorated using [babel-plugin-trace-execution](https://github.com/skidding/babel-plugin-trace-execution) and executed to record the context at every step. Literally the same source file.
- Going back and forth between function execution (and call stack when algorithm uses recursion) is effortless. So is pausing and resuming.
- Visualizations are easy to follow, fun to play with and simple enough to fit inside the screen of any modern phone.

## Work in progress

- Follow [@skidding](https://twitter.com/skidding) for updates
- Check out gifs attached to [Releases](https://github.com/skidding/illustrated-algorithms/releases) to see project evolution
- See [How to contribute](#how-to-contribute) below

## Dynamic styles

This project uses [styled-jsx](https://github.com/zeit/styled-jsx), but takes the idea of *CSS-in-JS* even further. Sizing, positioning and transition offsets are computed by JS, all before elements hit the DOM. This provides complete control over layout (e.g. font scaling relative to container width, rounded to a multiplier of 2) and animation (e.g. pausing in the middle of a transition and rewinding). It's a wild concept that hopefully gets mainstream someday.

## How to contribute

Consider the following actions if you want to advance this project:

- Find and/or fix bugs
- Add tests to [babel-plugin-trace-execution](https://github.com/skidding/babel-plugin-trace-execution)
- Improve rendering perf (already decent, but not ideal due to [how styles are applied](#dynamic-styles))
- Propose algorithms to add (that can fit in a func <=25 lines of ES6)
- Create elegant illustrations (sketches/wireframes do) – **Hello graphic designers and people who draw!**

Before submitting a PR, make sure to:
- Briefly describe the value of your contribution
- Stay in line with the project's mission (i.e. to make algorithms easy, see above sections)
- Test code before committing it via `npm run test`
- Thoroughly test the visual experience you're creating (e.g. algorithms must fit nicely on the screen)

## Development

```bash
npm i
# Start Next.js server (localhost:3000)
npm run dev
# Run tests
npm test
# Start React Cosmos playground (localhost:8989)
npm run cosmos
```

## Footnotes

While this project doesn't focus on algorithm implementation specifics, here's a list of valuable insights brought up by the community which serves to complement the visuals.

#### Binary Search

- [#21](https://github.com/skidding/illustrated-algorithms/issues/21) Calculating `mid` can be improved to avoid overflow when list is sufficiently large enough ([@mhaji](https://github.com/mhaji))

#### Quicksort

- [#19](https://github.com/skidding/illustrated-algorithms/issues/19) Extending implementation to support duplicates ([@ACollectionOfAtoms](https://github.com/ACollectionOfAtoms))

---

Please note that this project is released with a [Contributor Code of Conduct.](CODE_OF_CONDUCT.md) By participating in this project you agree to abide by its terms.