Bas Terwijn 
Common ๐ฑ๐ถ๐ฐ๐ operations in Python.
Run this and more in Memory Graph Web Debugger:https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph_examples/refs/heads/main/dict_operations.py&play
An exercise to help build the right mental model for Python data.
- Solution: https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph_videos/refs/heads/main/exercises/exercise19.py&play
- Explanation: https://github.com/bterwijn/memory_graph?tab=readme-ov-file#python-data-model
The โSolutionโ link visualizes execution and reveals whatโs actually happening using ๐บ๐ฒ๐บ๐ผ๐ฟ๐_๐ด๐ฟ๐ฎ๐ฝ๐ต: https://lnkd.in/e3sUM7wG
Ever wondered what a Trie actually looks like in memory?
A Trie is a tree of dictionaries, often used for problems like:
- prefix search
- word completion
- spell checking
- sequence matching
Package ๐ฆ๐๐ฆ๐จ๐ซ๐ฒ_๐ ๐ซ๐๐ฉ๐ก can show how data structures like Trie grow step by step. Instead of only reading code, you can see data structures being built in memory.
Run the live demo: https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/build_trie.py×tep=0.2&play
More ๐ฆ๐๐ฆ๐จ๐ซ๐ฒ_๐ ๐ซ๐๐ฉ๐ก examples: https://www.linkedin.com/groups/13244150/
Common ๐น๐ถ๐๐ operations in Python.
Run this and more in Memory Graph Web Debugger: https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph_examples/refs/heads/main/list_operations.py&play
An exercise to help build the right mental model for Python data.
- Solution: https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph_videos/refs/heads/main/exercises/exercise18.py&play
- Explanation: https://github.com/bterwijn/memory_graph?tab=readme-ov-file#python-data-model
Common ๐๐ฒ๐ operation in Python.
Run it in Memory Graph Web Debugger: https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph_examples/refs/heads/main/set_operations.py&play
An exercise to help build the right mental model for Python data.
- Solution: https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph_videos/refs/heads/main/exercises/exercise15.py&play
- Explanation: https://github.com/bterwijn/memory_graph?tab=readme-ov-file#python-data-model
The โSolutionโ link visualizes execution and reveals whatโs actually happening using ๐บ๐ฒ๐บ๐ผ๐ฟ๐_๐ด๐ฟ๐ฎ๐ฝ๐ต: https://github.com/bterwijn/memory_graph
How does Radix Sort work?
Algorithms like Radix Sort: https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/radix_sort.py×tep=0.2&play
are much easier to understand when you can see every intermediate step.
Using ๐บ๐ฒ๐บ๐ผ๐ฟ๐_๐ด๐ฟ๐ฎ๐ฝ๐ต: https://github.com/bterwijn/memory_graph#readme
you can watch how Radix Sort repeatedly applies stable Counting Sort, sorting the least significant digit up to the most significant digit in turn.
Radix Sort is be very efficient, with time complexity O(n ยท d), where 'n' is the number of values and 'd' is the number of digits.
Algorithms can be easier understood with step-by-step visualization using ๐บ๐ฒ๐บ๐ผ๐ฟ๐_๐ด๐ฟ๐ฎ๐ฝ๐ต. Here we show a Breadth First algorithm that finds the shortest path in a graph from node 'a' to node 'b': https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/breadth_first.py&breakpoints=31&continues=1×tep=0.2&play
๐บ๐ฒ๐บ๐ผ๐ฟ๐_๐ด๐ฟ๐ฎ๐ฝ๐ต github: https://github.com/bterwijn/memory_graph#readme
An exercise to help build the right mental model for Python data.
- Solution: https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph_videos/refs/heads/main/exercises/exercise12.py&play
- Explanation: https://github.com/bterwijn/memory_graph?tab=readme-ov-file#python-data-model
The โSolutionโ link visualizes execution and reveals whatโs actually happening using ๐บ๐ฒ๐บ๐ผ๐ฟ๐_๐ด๐ฟ๐ฎ๐ฝ๐ต: https://lnkd.in/e3sUM7wG
