{"id":26402433,"url":"https://github.com/amankumar7340/react-web","last_synced_at":"2026-04-14T10:33:02.989Z","repository":{"id":282261313,"uuid":"947973716","full_name":"Amankumar7340/React-Web","owner":"Amankumar7340","description":"Algorithm visualizer is a react base web app where we can visualize and play with algorithm.","archived":false,"fork":false,"pushed_at":"2025-04-22T18:19:57.000Z","size":18145,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-22T19:37:44.236Z","etag":null,"topics":["css","html","javascript","react","reactjs","vercel","vercel-deployment"],"latest_commit_sha":null,"homepage":"https://react-web-5h14.vercel.app","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Amankumar7340.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2025-03-13T14:42:44.000Z","updated_at":"2025-04-22T18:20:00.000Z","dependencies_parsed_at":null,"dependency_job_id":"0b116cf0-59dc-41c5-b82a-d6cc990a8b7f","html_url":"https://github.com/Amankumar7340/React-Web","commit_stats":null,"previous_names":["amankumar7340/react-web"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Amankumar7340/React-Web","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Amankumar7340%2FReact-Web","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Amankumar7340%2FReact-Web/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Amankumar7340%2FReact-Web/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Amankumar7340%2FReact-Web/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Amankumar7340","download_url":"https://codeload.github.com/Amankumar7340/React-Web/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Amankumar7340%2FReact-Web/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279016574,"owners_count":26085850,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-13T02:00:06.723Z","response_time":61,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["css","html","javascript","react","reactjs","vercel","vercel-deployment"],"created_at":"2025-03-17T15:18:49.008Z","updated_at":"2025-10-13T18:20:03.442Z","avatar_url":"https://github.com/Amankumar7340.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cdiv align=\"center\" style=\"height: 130px\"\u003e\n\n\u003ch1 align=\"center\"\u003e  ALGO / VISUALIZER \u003c/h1\u003e\nAlgorithm visualizer is a react base web app where we can visualize and play with algorithm.\n\n\u003c/div\u003e\n\n## Algorithms\n\n- Bubble Sort\n- Quick Sort\n- Singly Linked List\n- DFS\n- Dijkstra\n\n## Prerequisite\n\n- Basic coding knowledge\n\n- Some concept about data structure and algorithm\n\n- Mathematices\n\n## Project Initialization\n\n- Clone the project\n\n- Change directory to AlgoVisualizer\n\n        cd AlgoVisualizer\n\n- Open terminal and write\n\n        npm install\n\n- To run the code\n\n        npm start\n\n### Technologies\n\n\u003cimg align=\"left\" height=\"32\" width=\"32\" src=\"https://raw.githubusercontent.com/github/explore/80688e429a7d4ef2fca1e82350fe8e3517d3494d/topics/html/html.png\" /\u003e\n\n\u003cimg align=\"left\" height=\"32\" width=\"32\" src=\"https://raw.githubusercontent.com/github/explore/80688e429a7d4ef2fca1e82350fe8e3517d3494d/topics/css/css.png\" /\u003e\n\n\u003cimg align=\"left\" height=\"32\" width=\"32\" src=\"https://raw.githubusercontent.com/github/explore/80688e429a7d4ef2fca1e82350fe8e3517d3494d/topics/javascript/javascript.png\" /\u003e\n\n\u003cimg align=\"left\" height=\"32\" width=\"32\" src=\"https://brandeps.com/logo-download/N/Node-JS-logo-vector-01.svg\" /\u003e\n\n\u003cimg align=\"left\" height=\"32\" width=\"32\" src=\"https://brandeps.com/icon-download/J/Jss-icon-vector-01.svg\" /\u003e\n\n\u003cimg align=\"left\" height=\"32\" width=\"32\" src=\"https://raw.githubusercontent.com/github/explore/80688e429a7d4ef2fca1e82350fe8e3517d3494d/topics/react/react.png\" /\u003e\n\n\u003cimg align=\"left\" height=\"32\" width=\"32\" src=\"https://raw.githubusercontent.com/github/explore/80688e429a7d4ef2fca1e82350fe8e3517d3494d/topics/redux/redux.png\" /\u003e\n\n\u003cimg align=\"left\" height=\"32\" width=\"32\" src=\"https://brandeps.com/logo-download/Y/Yarn-logo-vector-01.svg\" /\u003e\n\n\u003cimg align=\"left\" height=\"32\" width=\"32\" src=\"https://brandeps.com/icon-download/N/Npm-icon-vector-07.svg\" /\u003e\n\n\u003cbr\u003e\n\n## Highlights\n\n\u003cimg style=\"margin-top: 20px;margin-bottom:20px\" src=\"./Github/Gif/Gif-Full-Tutorial.gif\"/\u003e\n\n## Words about this project\n\n\u003cdiv\u003e\n\n\u003ch2 style=\"color: #323dfa; font-weight:500\"\u003e Bubble Sort \u003c/h2\u003e\n\u003cp\u003e\n  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.\n\n**And Degree of Polynomial :- 2**\n\n**Time Complexity is O(n^2) .**\n\nTime Complexity is n^2 because here i used Two itarations .\n\n\u003c/p\u003e\n  \u003cimg src='./Github/Images/BubbleSort.png'\u003e\n\n\u003c/div\u003e\n\n\u003cdiv\u003e\n\n\u003ch2 style=\"color: #323dfa; font-weight:500\"\u003e Quick Sort \u003c/h2\u003e\n\u003cp\u003e\n  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\n\n**Time Complexity is O(n log n)**\n\n\u003c/p\u003e\n  \u003cimg src='./Github/Images/QuickSort.png'\u003e\n\n\u003c/div\u003e\n\n\u003cdiv\u003e\n\n\u003ch2 style=\"color: #323dfa; font-weight:500\"\u003e Singly Linked List \u003c/h2\u003e\n\u003cp\u003e\n   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 \u003cstrong\u003e One Dircetional \u003c/strong\u003e like \u003cstrong\u003e Vector in Mathematices\u003c/strong\u003e.\n   We can add or remove element from the front, the end or from anywhere in the list. \u003cstrong style=\"color:red \"\u003e But in This project we can remove or add from last in list\u003c/strong\u003e\n\n\u003c/p\u003e\n  \u003cimg src='./Github/Images/SinglyLinkedList.png'\u003e\n\n\u003c/div\u003e\n\n\u003cdiv\u003e\n\n\u003ch2 style=\"color: #323dfa;font-weight:500;\"\u003e DFS \u003c/h2\u003e\n\u003cp\u003e\n   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 .\n\n\u003c/p\u003e\n  \u003cimg src='./Github/Images/Dfs.png'\u003e\n\n\u003c/div\u003e\n\n\u003cdiv\u003e\n\n\u003ch2 style=\"color: #323dfa; font-weight:500\"\u003e Dijkstra \u003c/h2\u003e\n\u003cp\u003e\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 .\n\n\u003c/p\u003e\n  \u003cimg src='./Github/Images/Dijkstra.png'\u003e\n\n\u003c/div\u003e\n\n\u003ch3\u003e Note : \u003c/h3\u003e\n\u003cul\u003e\n\u003cli style=\"color: #fb005f; font-weight:500\"\u003e \u003cstrong\u003e It is not mobile responsive \u003c/strong\u003e\u003c/li\u003e\n\u003cli style=\"color: #fb005f; font-weight:500\"\u003e\u003cstrong\u003e Please use Chrome browser (Recomanded)\u003c/strong\u003e \u003c/li\u003e\n\u003cli style=\"color: #fb005f; font-weight:500\"\u003e\u003cstrong\u003e If you have low end PC .Then before opening this web app close all tab (Recomanded) \u003c/strong\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\n### PROJECT URL :\n\nDeployment Server :- \u003cspan\u003e Vercel \u003c/span\u003e\n\nurl: https://react-web-5h14.vercel.app\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Famankumar7340%2Freact-web","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Famankumar7340%2Freact-web","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Famankumar7340%2Freact-web/lists"}