ThuyNT13

@ThuyNT13·4 public vizzes

implement a Rolling Hash in C#

This example demonstrates a rolling hash algorithm implemented in C# to search for a pattern substring within a larger string. The code calculates a numeric hash for the pattern and for each sliding window of the text, updating the hash incrementally by subtracting the outgoing character’s contribution, dividing by the prime base 7, and adding the incoming character’s hash. It uses `Math.Pow` for exponentiation and `Console.WriteLine` to output the pattern hash, running substring hashes, and comparison results. The example shows the algorithmic steps without using external visualization libraries, relying on console output to trace the hash updates.

Nov 5, 2018

Loading thumbnail…

Thùy Ngô resume

This interactive resume presents Thùy Ngô’s professional history and skills as a network visualization. React manages the component structure, while D3.js drives a force-directed graph using `d3.forceSimulation` to position nodes for experience, education, and tools, with links showing relationships between them. Hovering highlights connected nodes and displays details in a side panel, making the resume explorable. The raw data comes from a Markdown file parsed into the visualization.

Jun 1, 2018

Loading thumbnail…

Big O Notation

This visualization explains Big O notation by pairing a written tutorial with an illustrative graph of algorithmic complexity. The graph plots the number of operations against input size for common complexity classes, including O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ), and O(n!). It uses a static image sourced from Big O Cheat Sheet, rendered with standard Markdown image embedding, and is accompanied by Python code examples that demonstrate each growth rate, such as `print_first` for O(1) and nested loops for O(n²). The example shows how runtime scales with input size and highlights the trade-off between time and space efficiency.

Jan 15, 2018

Loading thumbnail…

LinkedList overview

This visualization demonstrates the structure and operations of linked lists using a text-heavy, illustrated format. It explains node organization, head and tail pointers, and contrasts arrays with linked lists through diagrams and Python code examples. The markdown document includes code snippets defining `ListNode` and `LinkedList` classes, with methods like `setHead` and `insertAtEnd`, and uses embedded images from external sources to show memory layouts. The content also covers algorithmic complexity, comparing O(1) insertions versus O(n) access, and ends with a coding challenge about determining even or odd list length.

Jan 15, 2018