dsa_visualizer 0.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (38) hide show
  1. checksums.yaml +7 -0
  2. data/LICENSE.txt +21 -0
  3. data/README.md +323 -0
  4. data/USAGE.md +359 -0
  5. data/bin/dsa_visualizer +5 -0
  6. data/lib/dsa_visualizer/algorithms/dynamic_programming.rb +23 -0
  7. data/lib/dsa_visualizer/algorithms/graph_algorithms.rb +23 -0
  8. data/lib/dsa_visualizer/algorithms/greedy.rb +11 -0
  9. data/lib/dsa_visualizer/algorithms/searching.rb +78 -0
  10. data/lib/dsa_visualizer/algorithms/sorting.rb +77 -0
  11. data/lib/dsa_visualizer/algorithms/string_algorithms.rb +11 -0
  12. data/lib/dsa_visualizer/cli.rb +281 -0
  13. data/lib/dsa_visualizer/comparator.rb +57 -0
  14. data/lib/dsa_visualizer/data_structures/array.rb +109 -0
  15. data/lib/dsa_visualizer/data_structures/binary_tree.rb +104 -0
  16. data/lib/dsa_visualizer/data_structures/bst.rb +11 -0
  17. data/lib/dsa_visualizer/data_structures/deque.rb +11 -0
  18. data/lib/dsa_visualizer/data_structures/doubly_linked_list.rb +11 -0
  19. data/lib/dsa_visualizer/data_structures/graph.rb +11 -0
  20. data/lib/dsa_visualizer/data_structures/hash_table.rb +61 -0
  21. data/lib/dsa_visualizer/data_structures/heap.rb +17 -0
  22. data/lib/dsa_visualizer/data_structures/linked_list.rb +197 -0
  23. data/lib/dsa_visualizer/data_structures/priority_queue.rb +11 -0
  24. data/lib/dsa_visualizer/data_structures/queue.rb +110 -0
  25. data/lib/dsa_visualizer/data_structures/stack.rb +207 -0
  26. data/lib/dsa_visualizer/data_structures/string.rb +11 -0
  27. data/lib/dsa_visualizer/data_structures/trie.rb +11 -0
  28. data/lib/dsa_visualizer/data_structures/union_find.rb +11 -0
  29. data/lib/dsa_visualizer/fundamentals/complexity.rb +264 -0
  30. data/lib/dsa_visualizer/fundamentals/memory.rb +285 -0
  31. data/lib/dsa_visualizer/fundamentals/pointers.rb +311 -0
  32. data/lib/dsa_visualizer/fundamentals/recursion.rb +63 -0
  33. data/lib/dsa_visualizer/memory_tracker.rb +49 -0
  34. data/lib/dsa_visualizer/notes_manager.rb +85 -0
  35. data/lib/dsa_visualizer/version.rb +3 -0
  36. data/lib/dsa_visualizer/visualizer.rb +58 -0
  37. data/lib/dsa_visualizer.rb +114 -0
  38. metadata +157 -0
@@ -0,0 +1,49 @@
1
+ module DSAVisualizer
2
+ class MemoryTracker
3
+ attr_reader :allocations, :operations
4
+
5
+ def initialize
6
+ @allocations = []
7
+ @operations = []
8
+ @step_count = 0
9
+ end
10
+
11
+ def track_allocation(type, size, object)
12
+ @allocations << {
13
+ type: type,
14
+ size: size,
15
+ address: object.object_id,
16
+ timestamp: Time.now
17
+ }
18
+ end
19
+
20
+ def track_operation(operation, details)
21
+ @step_count += 1
22
+ @operations << {
23
+ step: @step_count,
24
+ operation: operation,
25
+ details: details,
26
+ timestamp: Time.now
27
+ }
28
+ end
29
+
30
+ def print_summary
31
+ puts "\nšŸ“Š Memory & Operations Summary:".colorize(:cyan).bold
32
+ puts "\nAllocations: #{@allocations.size}"
33
+ @allocations.each do |alloc|
34
+ puts " - #{alloc[:type]} (size: #{alloc[:size]}) at 0x#{alloc[:address].to_s(16)}"
35
+ end
36
+
37
+ puts "\nOperations: #{@operations.size}"
38
+ @operations.each do |op|
39
+ puts " #{op[:step]}. #{op[:operation]}: #{op[:details]}"
40
+ end
41
+ end
42
+
43
+ def reset
44
+ @allocations.clear
45
+ @operations.clear
46
+ @step_count = 0
47
+ end
48
+ end
49
+ end
@@ -0,0 +1,85 @@
1
+ module DSAVisualizer
2
+ class NotesManager
3
+ def self.print_notes(title, notes)
4
+ puts "\nšŸ“ IMPORTANT NOTES - #{title}".colorize(:yellow).bold
5
+ puts "═" * 80
6
+ notes.each_with_index do |note, idx|
7
+ puts "#{idx + 1}. #{note}"
8
+ end
9
+ puts "═" * 80
10
+ end
11
+
12
+ def self.print_key_points(points)
13
+ puts "\nšŸŽÆ KEY POINTS TO REMEMBER".colorize(:green).bold
14
+ puts "─" * 80
15
+ points.each do |point|
16
+ puts " āœ“ #{point}".colorize(:green)
17
+ end
18
+ puts "─" * 80
19
+ end
20
+
21
+ def self.print_time_complexity(operations)
22
+ puts "\nā±ļø TIME COMPLEXITY SUMMARY".colorize(:cyan).bold
23
+ puts "─" * 80
24
+ operations.each do |op, complexity|
25
+ puts " #{op.ljust(30)} → #{complexity}".colorize(:light_blue)
26
+ end
27
+ puts "─" * 80
28
+ end
29
+
30
+ def self.print_space_complexity(complexity, explanation)
31
+ puts "\nšŸ’¾ SPACE COMPLEXITY".colorize(:magenta).bold
32
+ puts "─" * 80
33
+ puts " #{complexity}"
34
+ puts " #{explanation}"
35
+ puts "─" * 80
36
+ end
37
+
38
+ def self.print_when_to_use(use_cases)
39
+ puts "\nāœ… WHEN TO USE".colorize(:green).bold
40
+ puts "─" * 80
41
+ use_cases.each do |use_case|
42
+ puts " āœ“ #{use_case}".colorize(:green)
43
+ end
44
+ puts "─" * 80
45
+ end
46
+
47
+ def self.print_when_not_to_use(avoid_cases)
48
+ puts "\nāŒ WHEN NOT TO USE".colorize(:red).bold
49
+ puts "─" * 80
50
+ avoid_cases.each do |avoid_case|
51
+ puts " āœ— #{avoid_case}".colorize(:red)
52
+ end
53
+ puts "─" * 80
54
+ end
55
+
56
+ def self.print_real_world_examples(examples)
57
+ puts "\nšŸŒ REAL-WORLD APPLICATIONS".colorize(:yellow).bold
58
+ puts "─" * 80
59
+ examples.each_with_index do |example, idx|
60
+ puts " #{idx + 1}. #{example[:title]}".colorize(:yellow)
61
+ puts " #{example[:description]}"
62
+ end
63
+ puts "─" * 80
64
+ end
65
+
66
+ def self.print_common_mistakes(mistakes)
67
+ puts "\nāš ļø COMMON MISTAKES TO AVOID".colorize(:red).bold
68
+ puts "─" * 80
69
+ mistakes.each do |mistake|
70
+ puts " ⚠ #{mistake}".colorize(:light_red)
71
+ end
72
+ puts "─" * 80
73
+ end
74
+
75
+ def self.print_practice_problems(problems)
76
+ puts "\nšŸ’Ŗ PRACTICE PROBLEMS".colorize(:cyan).bold
77
+ puts "─" * 80
78
+ problems.each_with_index do |problem, idx|
79
+ puts " #{idx + 1}. #{problem[:title]} [#{problem[:difficulty]}]".colorize(:cyan)
80
+ puts " #{problem[:description]}"
81
+ end
82
+ puts "─" * 80
83
+ end
84
+ end
85
+ end
@@ -0,0 +1,3 @@
1
+ module DSAVisualizer
2
+ VERSION = "0.1.0"
3
+ end
@@ -0,0 +1,58 @@
1
+ module DSAVisualizer
2
+ class Visualizer
3
+ def self.print_header(title)
4
+ puts "\n" + "=" * 80
5
+ puts title.center(80).colorize(:cyan).bold
6
+ puts "=" * 80 + "\n"
7
+ end
8
+
9
+ def self.print_section(title)
10
+ puts "\n#{title}".colorize(:yellow).bold
11
+ puts "-" * 60
12
+ end
13
+
14
+ def self.print_step(step_num, description)
15
+ puts "\n[Step #{step_num}] ".colorize(:green) + description
16
+ end
17
+
18
+ def self.print_memory(label, data)
19
+ puts "\n#{label}:".colorize(:magenta)
20
+ puts " Memory Address: #{data.object_id}".colorize(:light_black)
21
+ puts " Value: #{data.inspect}"
22
+ end
23
+
24
+ def self.print_comparison(ruby_code, cpp_code, explanation)
25
+ puts "\nā”Œā”€ Ruby Implementation ".ljust(79, "─") + "┐"
26
+ ruby_code.each_line { |line| puts "│ #{line.chomp}".ljust(79) + "│" }
27
+ puts "ā””".ljust(79, "─") + "ā”˜"
28
+
29
+ puts "\nā”Œā”€ C++ Implementation ".ljust(79, "─") + "┐"
30
+ cpp_code.each_line { |line| puts "│ #{line.chomp}".ljust(79) + "│" }
31
+ puts "ā””".ljust(79, "─") + "ā”˜"
32
+
33
+ puts "\nšŸ’” Core Difference:".colorize(:light_blue)
34
+ puts " #{explanation}"
35
+ end
36
+
37
+ def self.visualize_array(arr, highlight_index = nil)
38
+ print "\n["
39
+ arr.each_with_index do |val, idx|
40
+ if idx == highlight_index
41
+ print " #{val} ".colorize(:background => :green)
42
+ else
43
+ print " #{val} "
44
+ end
45
+ print "|" unless idx == arr.length - 1
46
+ end
47
+ puts "]"
48
+ end
49
+
50
+ def self.visualize_memory_layout(structure_name, elements)
51
+ puts "\nšŸ“¦ Memory Layout (#{structure_name}):".colorize(:cyan)
52
+ elements.each_with_index do |elem, idx|
53
+ addr = elem.object_id
54
+ puts " [#{idx}] Address: 0x#{addr.to_s(16)} → Value: #{elem}"
55
+ end
56
+ end
57
+ end
58
+ end
@@ -0,0 +1,114 @@
1
+ require 'colorize'
2
+ require 'tty-box'
3
+ require 'tty-table'
4
+
5
+ require_relative 'dsa_visualizer/version'
6
+ require_relative 'dsa_visualizer/visualizer'
7
+ require_relative 'dsa_visualizer/memory_tracker'
8
+ require_relative 'dsa_visualizer/comparator'
9
+ require_relative 'dsa_visualizer/cli'
10
+ require_relative 'dsa_visualizer/notes_manager'
11
+
12
+ # Fundamentals
13
+ require_relative 'dsa_visualizer/fundamentals/complexity'
14
+ require_relative 'dsa_visualizer/fundamentals/memory'
15
+ require_relative 'dsa_visualizer/fundamentals/pointers'
16
+ require_relative 'dsa_visualizer/fundamentals/recursion'
17
+
18
+ # Data Structures
19
+ require_relative 'dsa_visualizer/data_structures/array'
20
+ require_relative 'dsa_visualizer/data_structures/string'
21
+ require_relative 'dsa_visualizer/data_structures/linked_list'
22
+ require_relative 'dsa_visualizer/data_structures/doubly_linked_list'
23
+ require_relative 'dsa_visualizer/data_structures/stack'
24
+ require_relative 'dsa_visualizer/data_structures/queue'
25
+ require_relative 'dsa_visualizer/data_structures/deque'
26
+ require_relative 'dsa_visualizer/data_structures/priority_queue'
27
+ require_relative 'dsa_visualizer/data_structures/hash_table'
28
+ require_relative 'dsa_visualizer/data_structures/binary_tree'
29
+ require_relative 'dsa_visualizer/data_structures/bst'
30
+ require_relative 'dsa_visualizer/data_structures/heap'
31
+ require_relative 'dsa_visualizer/data_structures/graph'
32
+ require_relative 'dsa_visualizer/data_structures/trie'
33
+ require_relative 'dsa_visualizer/data_structures/union_find'
34
+
35
+ # Algorithms
36
+ require_relative 'dsa_visualizer/algorithms/sorting'
37
+ require_relative 'dsa_visualizer/algorithms/searching'
38
+ require_relative 'dsa_visualizer/algorithms/graph_algorithms'
39
+ require_relative 'dsa_visualizer/algorithms/dynamic_programming'
40
+ require_relative 'dsa_visualizer/algorithms/greedy'
41
+ require_relative 'dsa_visualizer/algorithms/string_algorithms'
42
+
43
+ module DSAVisualizer
44
+ class Error < StandardError; end
45
+
46
+ TOPIC_MAP = {
47
+ # Fundamentals
48
+ complexity_basics: -> { Fundamentals::Complexity.learn },
49
+ memory_basics: -> { Fundamentals::Memory.learn },
50
+ pointers_basics: -> { Fundamentals::Pointers.learn },
51
+ recursion_basics: -> { Fundamentals::Recursion.learn },
52
+
53
+ # Basic Data Structures
54
+ array: -> { DataStructures::Array.learn },
55
+ string: -> { DataStructures::String.learn },
56
+ linked_list: -> { DataStructures::LinkedList.learn },
57
+ doubly_linked_list: -> { DataStructures::DoublyLinkedList.learn },
58
+
59
+ # Stack & Queue
60
+ stack: -> { DataStructures::Stack.learn },
61
+ queue: -> { DataStructures::Queue.learn },
62
+ deque: -> { DataStructures::Deque.learn },
63
+ priority_queue: -> { DataStructures::PriorityQueue.learn },
64
+
65
+ # Hashing
66
+ hash_table: -> { DataStructures::HashTable.learn },
67
+
68
+ # Trees
69
+ binary_tree: -> { DataStructures::BinaryTree.learn },
70
+ bst: -> { DataStructures::BST.learn },
71
+ trie: -> { DataStructures::Trie.learn },
72
+
73
+ # Heaps
74
+ min_heap: -> { DataStructures::Heap.learn_min },
75
+ max_heap: -> { DataStructures::Heap.learn_max },
76
+
77
+ # Graphs
78
+ graph_representation: -> { DataStructures::Graph.learn },
79
+ bfs: -> { Algorithms::GraphAlgorithms.learn_bfs },
80
+ dfs: -> { Algorithms::GraphAlgorithms.learn_dfs },
81
+ dijkstra: -> { Algorithms::GraphAlgorithms.learn_dijkstra },
82
+
83
+ # Sorting
84
+ bubble_sort: -> { Algorithms::Sorting.learn_bubble },
85
+ merge_sort: -> { Algorithms::Sorting.learn_merge },
86
+ quick_sort: -> { Algorithms::Sorting.learn_quick },
87
+
88
+ # Searching
89
+ linear_search: -> { Algorithms::Searching.learn_linear },
90
+ binary_search: -> { Algorithms::Searching.learn_binary },
91
+
92
+ # Advanced
93
+ dp_intro: -> { Algorithms::DynamicProgramming.learn_intro },
94
+ dp_fibonacci: -> { Algorithms::DynamicProgramming.learn_fibonacci },
95
+ knapsack: -> { Algorithms::DynamicProgramming.learn_knapsack },
96
+
97
+ # Union Find
98
+ union_find: -> { DataStructures::UnionFind.learn }
99
+ }
100
+
101
+ def self.learn(topic)
102
+ handler = TOPIC_MAP[topic]
103
+ if handler
104
+ handler.call
105
+ else
106
+ puts "āŒ Topic not yet implemented: #{topic}".colorize(:red)
107
+ puts "Coming soon in the next update!"
108
+ end
109
+ end
110
+
111
+ def self.start_cli
112
+ CLI.start
113
+ end
114
+ end
metadata ADDED
@@ -0,0 +1,157 @@
1
+ --- !ruby/object:Gem::Specification
2
+ name: dsa_visualizer
3
+ version: !ruby/object:Gem::Version
4
+ version: 0.1.0
5
+ platform: ruby
6
+ authors:
7
+ - DSA Learning Team
8
+ autorequire:
9
+ bindir: bin
10
+ cert_chain: []
11
+ date: 2026-01-18 00:00:00.000000000 Z
12
+ dependencies:
13
+ - !ruby/object:Gem::Dependency
14
+ name: colorize
15
+ requirement: !ruby/object:Gem::Requirement
16
+ requirements:
17
+ - - "~>"
18
+ - !ruby/object:Gem::Version
19
+ version: '1.1'
20
+ type: :runtime
21
+ prerelease: false
22
+ version_requirements: !ruby/object:Gem::Requirement
23
+ requirements:
24
+ - - "~>"
25
+ - !ruby/object:Gem::Version
26
+ version: '1.1'
27
+ - !ruby/object:Gem::Dependency
28
+ name: tty-box
29
+ requirement: !ruby/object:Gem::Requirement
30
+ requirements:
31
+ - - "~>"
32
+ - !ruby/object:Gem::Version
33
+ version: '0.7'
34
+ type: :runtime
35
+ prerelease: false
36
+ version_requirements: !ruby/object:Gem::Requirement
37
+ requirements:
38
+ - - "~>"
39
+ - !ruby/object:Gem::Version
40
+ version: '0.7'
41
+ - !ruby/object:Gem::Dependency
42
+ name: tty-table
43
+ requirement: !ruby/object:Gem::Requirement
44
+ requirements:
45
+ - - "~>"
46
+ - !ruby/object:Gem::Version
47
+ version: '0.12'
48
+ type: :runtime
49
+ prerelease: false
50
+ version_requirements: !ruby/object:Gem::Requirement
51
+ requirements:
52
+ - - "~>"
53
+ - !ruby/object:Gem::Version
54
+ version: '0.12'
55
+ - !ruby/object:Gem::Dependency
56
+ name: rspec
57
+ requirement: !ruby/object:Gem::Requirement
58
+ requirements:
59
+ - - "~>"
60
+ - !ruby/object:Gem::Version
61
+ version: '3.12'
62
+ type: :development
63
+ prerelease: false
64
+ version_requirements: !ruby/object:Gem::Requirement
65
+ requirements:
66
+ - - "~>"
67
+ - !ruby/object:Gem::Version
68
+ version: '3.12'
69
+ - !ruby/object:Gem::Dependency
70
+ name: rake
71
+ requirement: !ruby/object:Gem::Requirement
72
+ requirements:
73
+ - - "~>"
74
+ - !ruby/object:Gem::Version
75
+ version: '13.0'
76
+ type: :development
77
+ prerelease: false
78
+ version_requirements: !ruby/object:Gem::Requirement
79
+ requirements:
80
+ - - "~>"
81
+ - !ruby/object:Gem::Version
82
+ version: '13.0'
83
+ description: A comprehensive gem for learning Data Structures and Algorithms from
84
+ scratch by visualizing concepts at the core level, comparing Ruby and C++ implementations
85
+ with step-by-step execution details, detailed notes, practice problems, and progress
86
+ tracking. Covers 12 sections from fundamentals to advanced topics with 50+ concepts.
87
+ email:
88
+ - team@example.com
89
+ executables:
90
+ - dsa_visualizer
91
+ extensions: []
92
+ extra_rdoc_files: []
93
+ files:
94
+ - LICENSE.txt
95
+ - README.md
96
+ - USAGE.md
97
+ - bin/dsa_visualizer
98
+ - lib/dsa_visualizer.rb
99
+ - lib/dsa_visualizer/algorithms/dynamic_programming.rb
100
+ - lib/dsa_visualizer/algorithms/graph_algorithms.rb
101
+ - lib/dsa_visualizer/algorithms/greedy.rb
102
+ - lib/dsa_visualizer/algorithms/searching.rb
103
+ - lib/dsa_visualizer/algorithms/sorting.rb
104
+ - lib/dsa_visualizer/algorithms/string_algorithms.rb
105
+ - lib/dsa_visualizer/cli.rb
106
+ - lib/dsa_visualizer/comparator.rb
107
+ - lib/dsa_visualizer/data_structures/array.rb
108
+ - lib/dsa_visualizer/data_structures/binary_tree.rb
109
+ - lib/dsa_visualizer/data_structures/bst.rb
110
+ - lib/dsa_visualizer/data_structures/deque.rb
111
+ - lib/dsa_visualizer/data_structures/doubly_linked_list.rb
112
+ - lib/dsa_visualizer/data_structures/graph.rb
113
+ - lib/dsa_visualizer/data_structures/hash_table.rb
114
+ - lib/dsa_visualizer/data_structures/heap.rb
115
+ - lib/dsa_visualizer/data_structures/linked_list.rb
116
+ - lib/dsa_visualizer/data_structures/priority_queue.rb
117
+ - lib/dsa_visualizer/data_structures/queue.rb
118
+ - lib/dsa_visualizer/data_structures/stack.rb
119
+ - lib/dsa_visualizer/data_structures/string.rb
120
+ - lib/dsa_visualizer/data_structures/trie.rb
121
+ - lib/dsa_visualizer/data_structures/union_find.rb
122
+ - lib/dsa_visualizer/fundamentals/complexity.rb
123
+ - lib/dsa_visualizer/fundamentals/memory.rb
124
+ - lib/dsa_visualizer/fundamentals/pointers.rb
125
+ - lib/dsa_visualizer/fundamentals/recursion.rb
126
+ - lib/dsa_visualizer/memory_tracker.rb
127
+ - lib/dsa_visualizer/notes_manager.rb
128
+ - lib/dsa_visualizer/version.rb
129
+ - lib/dsa_visualizer/visualizer.rb
130
+ homepage: https://github.com/Avinashkrmehta/dsa_visualizer
131
+ licenses:
132
+ - MIT
133
+ metadata:
134
+ bug_tracker_uri: https://github.com/yourusername/dsa_visualizer/issues
135
+ changelog_uri: https://github.com/yourusername/dsa_visualizer/blob/main/CHANGELOG.md
136
+ documentation_uri: https://github.com/yourusername/dsa_visualizer/blob/main/README.md
137
+ source_code_uri: https://github.com/yourusername/dsa_visualizer
138
+ post_install_message:
139
+ rdoc_options: []
140
+ require_paths:
141
+ - lib
142
+ required_ruby_version: !ruby/object:Gem::Requirement
143
+ requirements:
144
+ - - ">="
145
+ - !ruby/object:Gem::Version
146
+ version: 2.7.0
147
+ required_rubygems_version: !ruby/object:Gem::Requirement
148
+ requirements:
149
+ - - ">="
150
+ - !ruby/object:Gem::Version
151
+ version: '0'
152
+ requirements: []
153
+ rubygems_version: 3.5.11
154
+ signing_key:
155
+ specification_version: 4
156
+ summary: Learn DSA from Zero to Hero with Ruby and C++ comparisons
157
+ test_files: []