Hello, my name isEduardo Guiraldelli Schelive

Welcome to my blog where I share articles about web development, cloud infrastructure, system architecture, and modern technologies. Tutorials, guides, and hands-on experiences from real projects.

About me View articles

Arrays: Go vs JavaScript

Why Go makes you declare an array's size and JavaScript doesn't. Compare memory footprints with Uint32Array and see what JavaScript trades for convenience.

Read full article

Latest articles

Data Structures

Arrays: Go vs JavaScript

Why Go makes you declare an array's size and JavaScript doesn't. Compare memory footprints with Uint32Array and see what JavaScript trades for convenience.

October 6, 202615 minutes read

Fundamentals

Big O Notation

Learn how Big O describes the way an algorithm's cost grows with its input. Explore time and space complexity, the worst case, and every common class from O(1) to O(n!).

October 6, 202620 minutes read

Data Structures

Graphs

Learn how graphs model relationships between nodes. Explore directed, weighted and cyclic graphs, and how adjacency lists and matrices trade space for lookup speed in Go.

August 31, 202623 minutes read

Data Structures

Heap

Learn how a weaker invariant answers "what is the smallest right now". Explore the Priority Queue ADT, sifting up and down, the tree that fits in an array with no pointers, and why build-heap is O(n).

August 30, 202624 minutes read

Data Structures

Balanced Trees

Learn how rotations put a floor under a binary search tree. Explore the balance factor, AVL's four cases, why libraries chose red-black, and what balancing costs.

August 27, 202615 minutes read

Data Structures

Binary Search Trees

Learn how one ordering rule turns a binary tree into a search structure. Explore the recursive invariant, search, insert, the three delete cases, and why sorted input ruins everything.

August 26, 202616 minutes read

Data Structures

Binary Trees

Learn what the two-child limit buys you. Explore full, complete, perfect, balanced and degenerate shapes, why height governs cost, and how a binary tree fits in a flat array.

August 25, 202617 minutes read

Data Structures

Trees

Learn how trees organize data hierarchically with one parent per node. Explore root, depth and height, the V-1 edge rule, and how Go represents children in memory.

August 24, 202617 minutes read

Go Programming Language

Handling errors in goroutines

Learn two patterns for propagating errors from concurrent goroutines — the result struct and the separate error channel — and when to choose each.

May 9, 20267 minutes read

Go Programming Language

Pipelines, fan-out, and fan-in

Learn how to structure concurrent Go programs as pipelines of stages connected by channels, and how fan-out and fan-in parallelize the expensive ones.

May 9, 20267 minutes read

View all articles →

Explore categories

Data Structures

Master the art of organizing data efficiently. Learn how arrays, linked lists, trees, graphs, and hash tables shape the performance of every program you write.

Fundamentals

The ideas every other series builds on. Learn how to reason about cost, growth and scalability before choosing a data structure or an algorithm.

Go Programming Language

Learn Go from scratch. This series covers the full language: from basic types and control flow to functions, interfaces, error handling, goroutines, and module management.