DSALGO-VISUALIZER

KO | EN

gitlite — search

#typescript #ai-agents #deepseek-harness #dsh-plugin #open-source #ai #cli #dsh #claude-code #codex #developer-tools #react

DSALGO-VISUALIZER

★ 74 Open GitHub ↗

Learn Data Structures And Algorithms With Beautiful Animations.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

[**REPORT BUG**](https://github.com/jhabarsingh/DSALGO-VISUALIZER/issues)

# [DS ALGO](https://jhabarsingh.github.io/DSALGO-VISUALIZER/)  ⚡️ [![GitHub](https://img.shields.io/github/license/jhabarsingh/DSALGO-VISUALIZER?color=blue)](https://github.com/jhabarsingh/DSALGO-VISUALIZER/blob/master/LICENSE) [![GitHub stars](https://img.shields.io/github/stars/jhabarsingh/DSALGO-VISUALIZER)](https://github.com/jhabarsingh/DSALGO-VISUALIZER/stargazers)  [![GitHub contributors](https://img.shields.io/github/contributors/jhabarsingh/DSALGO-VISUALIZER.svg)](https://github.com/jhabarsingh/DSALGO-VISUALIZER/graphs/contributors)   [![GitHub issues](https://img.shields.io/github/issues/jhabarsingh/DSALGO-VISUALIZER.svg)](https://github.com/jhabarsingh/DSALGO-VISUALIZER/issues) [![GitHub forks](https://img.shields.io/github/forks/jhabarsingh/DSALGO-VISUALIZER.svg?style=social&label=Fork)](https://GitHub.com/jhabarsingh/DSALGO-VISUALIZER/network/)

<p align="center">
 <img style="margin:auto" width="300" src="https://github.com/jhabarsingh/DSALGO-VISUALIZER/blob/main/logo/logo_2.png?raw=true" />
 
</p>

> **<a href="https://jhabarsingh.github.io/DSALGO-VISUALIZER/" >Ds Algo visualizer</a>** is made for students who want to learn **Data structures and algorithms** with Animations. This project includes all the important data structures that are  being used widely.

### <a href="https://jhabarsingh.github.io/DSALGO-VISUALIZER/" >DSALGO VISUALIZER INCLUDES</a>

**DATA STRUCTURES**
 1.  [Array](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/array.html)
 2.  [Matrix](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/matrix.html)
 3.  [Stack](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/stack.html)
 4.  [Queue](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/queue.html)
 5.  [Heap](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/heap.html)
 6.  [Linked List](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/linkedlist.html)
 7.  [Binary Search Tree](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/tree.html)
 8.  [Graph](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/graph.html)
 9.  [String](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/string.html) 
 10. [Disjoint Set](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/disjoint.html)
 11. [Hashing Table](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/hashing_table.html)

**ARRAY ALGORITHMS**
  1. [Kadanes](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/array/kadane.html)
  2. [Prefix Sum](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/array/prefix_sum.html)
  3. [Sliding Window](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/array/sliding_windows.html)
  4. [Binary Search](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/search_algorithms/binary.html)
  5. [Linear Search](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/array/linear.html)
  6. [Array Partitioning](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/array/partition.html)
  7. [Linear Search](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/array/linear.html)
  8. [Rain Water Trapping](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/array/rain_water.html)

**STACK ALGORITHMS**
  1. [Balanced Bracket](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/stack/balanced_bracket.html)
  2. [Infix  To Postfix](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/stack/infix_to_postfix.html)
  3. [Infix To Prefix](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/stack/infix_to_prefix.html)
  4. [Postfix Evaluation](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/stack/postfix_evaluation.html)
  5. [Prefix Evaluation](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/stack/prefix_evaluation.html)
  6. [Maximum Area Under The Histogram](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/stack/max_area_hist.html)
  7. [Min Stack O(1)](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/stack/min_stack.html)

**MATRIX ALGORITHMS**
  1. [Transpose](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/matrix/transpose.html)
  2. [Kadanes 2D](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/matrix/kadanes.html)
  3. [Sorted Matrix Search](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/matrix/binary_search.html)
  4. [Sparse Matrix](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/matrix/sparse_matrix.html)

**QUEUE ALGORITHMS**
  1. [BFS](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/queue/bfs.html)

**HEAP ALGORITHMS**
  1. [Heapify](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/heap/heapify.html)
  2. [Heap Sort](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/heap/heap_sort.html)

**LINKED LIST ALGORITHMS**
  1. [Singly Linked List](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/linked_list/singly.html)
  2. [Doubly Linked List](http://jhabarsinghbhati.me.me/DSALGO-VISUALIZER/templates/linked_list/doubly.html)
  3. [Circular Linked List](http://jhabarsinghbhati.me.me/DSALGO-VISUALIZER/templates/linked_list/circular_singly.html)
  4. [Circular Doubly List](http://jhabarsinghbhati.me.me/DSALGO-VISUALIZER/templates/linked_list/circular_doubly.html)
  5. [Stack Using Linked List](http://jhabarsinghbhati.me.me/DSALGO-VISUALIZER/templates/linked_list/linked_stack.html)
  6. [Queue Using Linked List](http://jhabarsinghbhati.me.me/DSALGO-VISUALIZER/templates/linked_list/linked_queue.html)

**BINARY SEARCH TREE ALGORITHMS**
  1. [BST Implementation](http://jhabarsinghbhati.me.me/DSALGO-VISUALIZER/templates/bst/binary.html)
  2. [Traversal (Inorder, Preorder, Postorder)](http://jhabarsinghbhati.me.me/DSALGO-VISUALIZER/templates/bst/traversal.html)

**GRAPH ALGORITHMS**
  1.  [BFS](http://jhabarsinghbhati.me.me/DSALGO-VISUALIZER/templates/graphs/)
  2.  [DFS](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/graphs/)
  3.  [Flood Fill](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/graphs/flood_fill.html)
  4.  [Color Filling](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/graphs/color_filling.html)
  5.  [DFS Maze](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/graphs/create_dfs_maze.html)
  6.  [Cycle Detection (BFS / DFS)](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/graphs/detect_cycle.html)
  8.  [Kruskals](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/graphs/kruskals.html)
  9.  [Topological Sort](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/graphs/topological.html)
  11. [Bridges](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/graphs/bridges.html)
  12. [Graph Coloring](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/graphs/graph_coloring.html)
  13. [Travelling Salesman](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/graphs/travelling_salesman.html)
  
   
 **SORTING ALGORITHMS**
  1. [Heap Sort](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/sort_algorithms/heap.html)
  2. [Bubble Sort](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/sort_algorithms/bubble.html)
  3. [Selection Sort](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/sort_algorithms/selection.html)
  4. [Insertion Sort](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/sort_algorithms/insertion.html)
  5. [Quick Sort](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/sort_algorithms/quick.html)
  6. [Merge Sort](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/sort_algorithms/merge.html)
  7. [Counting Sort](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/sort_algorithms/counting.html)
  8. [Shell Sort](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/sort_algorithms/shell.html)
  
**BINARY SEARCH ALGORITHMS**
  1. [Binary Search](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/search_algorithms/binary.html)
  2. [Start Pont Of Rotated Array](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/search_algorithms/rotated_array.html)
  3. [Find Peak Element](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/search_algorithms/peak_element.html)
  4. [Biotonic Array Search](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/search_algorithms/biotonic_array.html)
  5. [Minimum Page Allocation](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/search_algorithms/minimum_page_allocation.html)

**RECURSION ALGORITHMS**
  1. [Factorial ](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/recursion/factorial.html)
  2. [H Tree Animation](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/recursion/h_tree.html)
  3. [Snow Flakes Animation](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/recursion/snow_flakes.html)
  4. [Tower Of Hanoi](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/recursion/tower_of_hanoi.html)

**BACKTRACKING ALGORITHMS**
  1. [N-Queen](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/backtracking/n_queen.html)
  2. [Maze Generator](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/backtracking/maze.html)
  3. [Sudoku](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/backtracking/sudoku.html)
  4. [Knight Tour](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/backtracking/knight_tour.html)
  5. [Graph Coloring](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/backtracking/graph_coloring.html)
  
**DIVIDE AND CONQUER PARADIGM**
  1. [Merge Sort](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/divide_and_conquer/merge.html)
  2. [Quick Sort](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/divide_and_conquer/quick.html)
  3. [Counting Inversion](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/divide_and_conquer/counting_inversion.html)

**GREEDY PARADIGM**
  1. [Kruskals](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/greedy/kruskals.html)
  2. [Fractional Knapsack](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/greedy/knapsack.html)
  3. [Counting Money](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/greedy/counting_money.html)
  4. [Job Scheduling](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/greedy/job_schedulling.html)
  5. [Huffman Coding](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/greedy/huffman_coding.html)
 
**DYNAMIC PROGRAMMING PARADIGM**
  1.  [Travelling Salesman](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/dynamic/travelling_salesman.html)
  2.  [0/1 Knapsack](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/dynamic/0_1_knapsack.html)
  3.  [Unbounded Knapsack](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/dynamic/unbounded_0_1_knapsack.html)
  4.  [Subset Sum](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/dynamic/subset_sum.html)
  5.  [Cutting Rod](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/dynamic/cutting_rod.html)
  6.  [Coin Change](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/dynamic/coin_change_making.html)
  7.  [Longest Common Subsequence](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/dynamic/longest_common_sequence.html)
  8.  [Levenshtein Distance ](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/dynamic/levenshtein.html)
  9. [Ladders Problem](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/dynamic/ladder.html)

**STRING ALGORITHMS**
  1. [Naive Matching](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/string/naive_search.html)
  2. [KMP](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/string/kmp.html)
  3. [Robin Karp](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/string/robin_karp.html)
  4. [Z Algorithm](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/string/z_function.html)
  5. [Boyer Moore](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/string/boyer_moore.html)

**DISJOINT SET ALGORITHMS**
  1. [Union](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/disjoint_set/union.html)
  2. [Find](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/disjoint_set/find.html)

**HASHING TABLE ALGORITHMS**
  1. [Open Hahing](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/hashing_table/open_hashing.html)
  2. [Closed Hashing](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/hashing_table/closed_hashing.html)
     1. [Linear Probing](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/hashing_table/closed_hashing/linear_probing.html)
     2. [Quadratic Probing](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/hashing_table/closed_hashing/quadratic_probing.html)
     3. [Double Hashing](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/hashing_table/closed_hashing/double_hashing.html)

**TIME COMPLEXITY**
  1. [Big-Oh (O)](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/time_complexity.html)
  2. [Big-Omege (Ω)](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/time_complexity.html)
  3. [Big Theta (θ)](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/time_complexity.html)

**NUMBER THEORY**
  1. [Sieve Of Eratosthenes](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/number_theory/sieve_of_eratosthenes.html)
  2. [GCD (Eucledian)](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/number_theory/gcd.html)
  3. [Extended Eucledian](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/number_theory/extended_eucledian.html)
  4. [Binary Exponentiation](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/number_theory/binary_exponentiation.html)

**P, NP, NP-HARD, NP-COMPLETE**
1. [NP-Hard](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/np_hard.html)
2. [NP-Complete](https://jhabarsingh.github.io/DSALGO-VISUALIZER/templates/np_hard.html)

## <a href="https://medium.com/mindsdb/contributing-to-an-open-source-project-how-to-get-started-6ba812301738">How To Contribure</a>
> When I thought of commencing this project the first doubt that came to mind was that Should I use Javascript Framework (REACT) or Vanilla Js To create this project and finally I decided to use Vanilla Js and the reason I came to this conclusion was that I wanted to keep this project simple so that more and more people could contribute and learn from it.

### You can contribute to this project in many ways
 1. You can create an issue if you find any bug.
 2. You can work on an existing issue and Send PR.
 3. You can add another data structure or Algorithm to the existing project and Send a PR.
 4. Even if you find any grammatical or spelling mistake then also you can create an issue.

> *I would be glad to see a notification saying `User {xyz} created a Pull Request`.
I promise to review it.*

## Contributors ✨

Thanks goes to these wonderful people

<table>
  <tr>
    <td align="center"><a href="https://github.com/aditya28sarin"><img src="https://avatars.githubusercontent.com/u/48805315?v=4?s=100" width="100px;" alt=""/><br /><sub><b>Aditya Sarin</b></sub></a><br /><a href="https://github.com/jhabarsingh/DSALGO-VISUALIZER/commits?author=aditya28sarin" title="Documentation">📖</a></td>
    <td align="center"><a href="https://github.com/SwampDolphin97"><img src="https://avatars.githubusercontent.com/u/27912312?v=4?s=100" width="100px;" alt=""/><br /><sub><b>XHunter</b></sub></a><br /><a href="https://github.com/jhabarsingh/DSALGO-VISUALIZER/commits?author=SwampDolphin97" title="Documentation">📖</a></td>
  </tr>
</table>

DSALGO-VISUALIZER

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README