Name		Name	Last commit message	Last commit date
Latest commit History 73 Commits
.github/workflows		.github/workflows
public		public
src		src
.babelrc		.babelrc
.eslintignore		.eslintignore
.eslintrc.json		.eslintrc.json
.firebaserc		.firebaserc
.gitignore		.gitignore
.prettierignore		.prettierignore
.prettierrc.json		.prettierrc.json
LICENSE		LICENSE
README.md		README.md
firebase.json		firebase.json
package-lock.json		package-lock.json
package.json		package.json
screenshot.png		screenshot.png
tsconfig.json		tsconfig.json
webpack.config.js		webpack.config.js

Repository files navigation

Alvis 🌟

My tool for visualizing algorithms

I use it to make algorithm YouTube videos

Play with the live demo

Algorithms

Bubble Sort

Complexity: O(n^2)T O(1)S

Animation source

YouTube Video:

Insertion Sort

Complexity: O(n^2)T O(1)S

Animation source

YouTube Video:

Selection Sort

Complexity: O(n^2)T O(1)S

Animation source

YouTube Video:

Binary Search

Complexity: O(log n)T O(1)S

Animation source

YouTube Video:

Breadth-First Search

Complexity: O(V+E)T O(V)S

Animation source

YouTube Video:

Depth-First Search

Complexity: O(V+E)T O(V)S

Animation source

YouTube Video:

Topological Sort

Complexity: O(V+E)T O(V)S

Animation source

YouTube Video:

Dijkstra's Algorithm

Complexity: O((V + E) log V)T O(V)S

Animation source

YouTube Video:

Why Dijkstra's Algorithm Doesn't Work with Negative Weights

YouTube Video:

Minimum Size Subarray (Sliding Window Technique)

Complexity: O(n)T O(1)S

Animation source

YouTube Video:

Max Sum Fixed Subarray (Sliding Window Technique)

Complexity: O(n)T O(1)S

Animation source

License

This project is licensed under the MIT License - see the LICENSE file for details