https://github.com/amankumar7340/react-web
Algorithm visualizer is a react base web app where we can visualize and play with algorithm.
https://github.com/amankumar7340/react-web
css html javascript react reactjs vercel vercel-deployment
Last synced: 2 months ago
JSON representation
Algorithm visualizer is a react base web app where we can visualize and play with algorithm.
- Host: GitHub
- URL: https://github.com/amankumar7340/react-web
- Owner: Amankumar7340
- Created: 2025-03-13T14:42:44.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2025-04-22T18:19:57.000Z (about 1 year ago)
- Last Synced: 2025-04-22T19:37:44.236Z (about 1 year ago)
- Topics: css, html, javascript, react, reactjs, vercel, vercel-deployment
- Language: JavaScript
- Homepage: https://react-web-5h14.vercel.app
- Size: 17.3 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
ALGO / VISUALIZER
Algorithm visualizer is a react base web app where we can visualize and play with algorithm.
## Algorithms
- Bubble Sort
- Quick Sort
- Singly Linked List
- DFS
- Dijkstra
## Prerequisite
- Basic coding knowledge
- Some concept about data structure and algorithm
- Mathematices
## Project Initialization
- Clone the project
- Change directory to AlgoVisualizer
cd AlgoVisualizer
- Open terminal and write
npm install
- To run the code
npm start
### Technologies
## Highlights
## Words about this project
Bubble Sort
Bubble Sort is simple sorting algorithm. It is slow sorting alogithm .It used loop for sorting. This algorithm used loop so Time Complexity is high.
**And Degree of Polynomial :- 2**
**Time Complexity is O(n^2) .**
Time Complexity is n^2 because here i used Two itarations .
Quick Sort
Quick Sort is divide and conquer algorithms. Basically It has a pivot index . Using the pivot index it apply recursion . As, It is use recursion so it's time complexity will reduce
**Time Complexity is O(n log n)**
Singly Linked List
Singly Linked List is a type of Data structure . Where it can used in store Data . In this List where every element has a Head and Tail . And every element pointing to tail . And it is a One Dircetional like Vector in Mathematices.
We can add or remove element from the front, the end or from anywhere in the list. But in This project we can remove or add from last in list
DFS
DFS is searching technique in a Graph . DFS means Depth first search. In this technique search will happen in depth of tree if seaching node is found then search is complete but id searching node is not found . it will backtrack .
Dijkstra
Dijkstra is very popular algorithms. It found the sortest path between two nodes . It works in weight grarph. To find the sortest path we can use adjecency matrix or adjecency list . Here i use adjecency List .
Note :
- It is not mobile responsive
-
Please use Chrome browser (Recomanded) - If you have low end PC .Then before opening this web app close all tab (Recomanded)
### PROJECT URL :
Deployment Server :- Vercel
url: https://react-web-5h14.vercel.app