mastorna.it
IT

Site journal

Updates

New pages, experiments and visible changes to mastorna.it, from newest to oldest.

Follow via RSS Receive new entries in your feed reader.

  1. Bucket sort: CDF and a circular lab

    The guide explains how to evaluate a cumulative distribution and use quantiles to balance buckets.

    • The bucket sort page adds continuous, discrete and empirical CDF examples and an animated lab with points on a disk, angular sectors and equal-area radial rings.
    #

  2. Two interactive labs for paths in graphs

    The weighted-path guides now let readers follow each algorithm step by step on editable graphs.

    #

  3. All-pairs shortest paths: Johnson and Floyd–Warshall

    A new guide extends the weighted-graph series with two ways to compute a distance matrix.

    • The Johnson and Floyd–Warshall guide compares dynamic programming and reweighting on the same graph with a negative edge.
    • Worked examples and exercises cover path reconstruction, negative cycles, complexity and when to choose each method.
    #

  4. Shortest and longest paths: Dijkstra and Bellman–Ford

    A new guide to weighted graphs explains how to choose an optimal route and when no finite answer exists.

    • The shortest and longest paths guide covers relaxation, Dijkstra for nonnegative weights, Bellman–Ford for negative weights and longest paths in DAGs.
    • Worked examples and exercises show path reconstruction, negative-cycle detection and how to choose an algorithm for a given graph.
    #

  5. Graphs: topological sorting and minimum spanning trees

    Two new interactive guides show how to order dependencies and connect a network at minimum cost.

    • The topological sorting page covers DAGs, Kahn’s algorithm, cycle detection, ordering uniqueness and complexity through a step-by-step simulation.
    • The minimum spanning tree page compares Prim and Kruskal, cut and cycle properties, cost and complexity on the same editable weighted graph.
    • The labs include custom and random graphs, cycles, equal weights and disconnected components, full playback controls and synchronized pseudocode.
    #

  6. Graphs: watch BFS and DFS unfold step by step

    A new guide introduces graphs and makes the frontier, traversal tree and exploration order visible.

    • The graphs, BFS and DFS guide covers definitions, representations, properties, applications and a complete complexity analysis.
    • The interactive lab lets readers edit the graph, choose a start vertex and compare the BFS queue with the DFS stack using synchronized pseudocode.
    • The guided cases include cyclic, tree-shaped, disconnected, directed and random graphs, with BFS distances and DFS timestamps.
    #

  7. Linear algebra: three new interactive labs

    A new guide connects vectors, matrices, linear transformations and systems through three visual experiences.

    • The linear algebra page introduces linear combinations, independence, bases, matrix multiplication, determinants, rank and linear systems.
    • The multiplication lab lets readers edit values and dimensions, then builds each product cell while highlighting its row, column and scalar products.
    • The geometric and algebraic experiments visualize a plane transformation and step-by-step Gauss-Jordan reduction, including solution classification.
    #

  8. Dynamic programming and Matrix Chain Order

    A new lab shows how dynamic programming builds an optimal solution from smaller subproblems.

    • The dynamic programming guide introduces optimal substructure, overlapping subproblems, memoization and the bottom-up approach.
    • The Matrix Chain Order visualizer fills the rotated triangular M and S tables step by step, compares every split and reconstructs the optimal parenthesization.
    • The experiment includes the classic six-matrix example, custom and random dimensions, synchronized pseudocode and full animation controls.
    #

  9. Interactive recursion and search trees

    Three new labs make call stacks, binary search trees and red-black balancing visible.

    • Recursion and the call stack explains base cases, frames, termination and complexity through synchronized factorial, Fibonacci and memoization visualizations.
    • Binary search trees and rotations introduces BST order, search, insertion, deletion and traversals through a modifiable tree with left and right rotations.
    • Red-black trees presents the balancing invariants and animates insertion step by step, including recoloring, triangle cases and rotations.
    • Every lab includes guided examples, forward and backward controls, complexity metrics and automatic checks of the properties being studied.
    #

  10. Asymptotic notation and interactive sorting

    The Algorithms section becomes a complete learning path: complexity theory, sorting comparisons and step-by-step graphical visualizations.

    • The asymptotic notation guide introduces O, Ω, Θ, o and ω, compares growth rates, and includes practical rules, examples and exercises.
    • The sorting algorithms overview compares best, average and worst cases, auxiliary memory, stability and in-place behaviour across seven algorithms.
    • The new pages with graphical visualizers show insertion, merge, quick, heap, counting, radix and bucket sort operation by operation, with custom or random arrays, highlighted pseudocode and counters.
    • Every algorithm now includes separate best-, average- and worst-case analysis, auxiliary-space requirements, stability and recommended uses.
    #

  11. Recurrence relations and the Master Theorem

    A new algorithms section begins with a guide to analysing recursive and divide-and-conquer algorithms.

    • The guide to recurrence relations and the Master Theorem introduces expansion, recursion trees and substitution, explains the theorem’s three cases and their conditions, and includes worked examples and exercises.
    • The new Algorithms section joins the main navigation and will collect future notes about algorithm analysis and design.
    #

  12. Probability, distributions and interactive labs

    The mathematics section gains a complete path from uncertainty to probability models, supported by examples and simulations.

    • The probability guide covers events, axioms, counting, conditional probability, Bayes, independence and limit theorems.
    • Random variables and distributions explores mean, median, mode, quantiles, variance and standard deviation through random data, squared-deviation tooltips and parameter-driven charts with quartiles.
    • Probability distributions in practice applies Bernoulli, binomial, geometric, Poisson, uniform, exponential and normal models to concrete cases, with a simulator and an interactive quiz.
    #

  14. Nonsensio & Molestio and the updates feed

    A new article covers twelve years of automatic theatre, while this public site journal makes its debut.

    #

  15. Clearer video recipes

    Small presentation changes make videos, ingredients and steps easier to distinguish.

    #

  16. The site becomes bilingual—and much larger

    A day of expansion brings Italian and English navigation, stories about my games, recipes and a link collection.

    • Alien Smash, Sym and Taurus and Andromeda receive pages about their history and development process.
    • Video recipes launch with five preparations illustrated step by step.
    • Links for getting pleasantly lost online collects useful, strange or simply interesting websites.
    • The new bilingual architecture adds canonical URLs, language alternates, a language switch and reorganized navigation.
    #

  17. Greek transliteration exercises

    A new interactive exercise set joins the Greek alphabet quiz.

    #

  18. The mathematics and Greek sections take shape

    References, guides and exercises expand the site into a place for study and revision.

    • The Greek alphabet and its interactive quiz introduce letters, pronunciation and recognition.
    • Powers and logarithms opens the extended mathematics guides.
    • Functions adds definitions, classifications, examples and exercises.
    • Light and dark themes become consistent across the site, with manual choice remembered by the browser.
    #

  19. A shared structure for Mastorna

    The first static pages become a small PHP site with shared elements and a consistent visual language.

    • Where does Mastorna come from? joins the new structure alongside the homepage and mathematical symbols reference.
    • Shared header, footer and metadata make it easier to grow the site without duplicating every element.
    #

  20. The first pages of mastorna.it

    The new version of the site begins with three essential places.

    • The homepage, the origin of the name Mastorna and the mathematical symbols reference form the project’s first core.
    #