- Bubble Sort
- Quick Sort
- Singly Linked List
- DFS
- Dijkstra
-
Basic coding knowledge
-
Some concept about data structure and algorithm
-
Mathematices
-
Clone the project
-
Change directory to AlgoVisualizer
cd AlgoVisualizer
-
Open terminal and write
npm i // or yarn add
-
To run the code
npm start // or yarn start
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 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)
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 .
- 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)
Deployment Server :- netlify