Priority queues are data structures that surface the most important item first. Learn how heaps power priority queues, where they appear in real systems, and how to implement them efficiently.

Learn how priority queues work, why they power schedulers and algorithms, and how heaps enable fast decisions in real systems.

Priority Queues Explained: Heaps, Performance, and Real Uses

What Is an Algorithm? The Soul of Every Program

Bubble Sort: The Gentle Art of Getting Things in Order

Insertion Sort: Building Order One Element at a Time

Selection Sort: Choosing the Right Element, One Pass at a Time

Merge Sort: Divide, Conquer, and Rebuild Order

Quick Sort: Order Through Partition

Heap Sort: Order Through Structured Chaos

Priority Queues: Choosing What Matters Next

Tokens are the meter your model charges in: context, latency, and cost. We'll make tokenization visible using your existing local Ollama service—first via a CLI token inspector + heatmap, then with a live-updating browser playground.

Grab the complete CLI and playground server files so you can run the demos without scrolling through the long code blocks.

CLI for counts, metrics, and token heatmaps via Ollama.

Token Inspector CLI (token-inspector.mjs)

Local server + embedded HTML playground for live token counts.

Tokenizer Playground Server (tokenizer-playground-server.mjs)

📥 Download the runnable code

CLI token heatmap + live tokenizer playground for local Ollama. Compare prompts, cut token waste, and enforce budgets + chunking rules.

Tokenization You Can See: Tokens, Heatmaps, Prompt Budgets

AI on Your Computer: Run a Local LLM Like a Service

Tokens Are the Unit of Pain: Tokenization You Can See

A practical deep dive into Heap Sort—how binary heaps work, why heap sort guarantees O(n log n), and how it compares to quicksort, mergesort, and selection sort across real systems.

Learn how Heap Sort works, why it guarantees O(n log n) performance, and how to implement it across multiple languages with benchmarks and visual explanations.

Heap Sort Explained: A Practical Guide to the Heap Algorithm

Run a local LLM on macOS, Linux, or Windows, call it over HTTP like a real service, stream output in Node/Python/Go/C++, and measure TTFT + throughput to understand what's actually happening.

Run an Ollama model locally on macOS, Linux, or Windows, stream output over HTTP, and measure TTFT and throughput with Node, Python, Go, and C++.

Run a Local LLM Like a Service: Streaming + TTFT Metrics

A deep, honest exploration of Quick Sort—how partitioning creates order, why average-case performance beats guarantees, and how design choices shape real-world speed.

Learn Quick Sort from first principles: partitioning, pivots, invariants, and why it dominates real-world sorting despite its worst case.

Quick Sort Algorithm Explained: Order Through Partition

How to wire AI into your CI pipeline, release process, and observability stack without handing the keys to an unreliable robot.

A visual summary of the three-part series: Strategy & Lifecycle, Day-to-Day Development, and Pipeline & Operations. Perfect for sharing with your team or keeping as a reference.

Download the complete trilogy overview poster

📄 AI & Software Engineering: The Trilogy and the System (PDF)

📥 Download the Trilogy Overview

Safe AI patterns for CI/CD: static analysis, test-gap radar, drift detection, incident copilots. Avoid Auto-Merger, Pipeline Gatekeeper, Shadow Policy.

AI in CI/CD Pipeline: Safe Integration Patterns for DevOps

Software Development in the Age of AI: How To Think Like an Engineer When Code Is Cheap

AI Code Assistants as Teammates: A Practical Playbook for Day-to-Day Engineering

AI in the SDLC Pipeline: Integrating Agents into CI Without Burning Down Production

A methodical deep dive into Merge Sort—how divide-and-conquer beats quadratic time, why merging is where correctness lives, and how O(n log n) changes what is possible at scale.

Master Merge Sort: the stable O(n log n) divide-and-conquer algorithm. Learn recursion, merging logic, performance tradeoffs, and production implementations.

Merge Sort Algorithm Explained: Divide and Conquer

A practical guide to the four metrics that explain why your API feels slow, plus a tiny demo API implemented across popular stacks with real measurement queries.

Master QPS, TPS, Concurrency, and Response Time—the four metrics that explain why APIs feel slow. Includes Little's Law, Prometheus queries, and code examples.

System Performance Metrics: QPS, TPS, Concurrency, RT

System Performance Metrics Every Engineer Should Know: QPS, TPS, Concurrency, Response Time

A practical exploration of Selection Sort—how it works, why its invariant matters, when it performs well, and how it compares to Bubble Sort and Insertion Sort. Includes pseudocode, diagrams, benchmarks, and implementations across major languages.

A practical guide to Selection Sort with diagrams, invariants, comparisons, pseudocode, and implementations in multiple languages.

Selection Sort: Choosing the Right Element, One Pass

Transform AI code assistants from unreliable oracles into trusted teammates. Learn the Spec → Tests → AI → Review workflow, three failure modes to avoid, and concrete patterns for leading AI agents effectively in your daily coding sessions.

Learn how to work with AI code assistants as teammates, not oracles. Master the Spec → Tests → AI → Review workflow and avoid common failure modes.

AI Code Assistants as Teammates: Practical Playbook

A deep, practical exploration of Insertion Sort—how it works, why its loop invariant matters, when it outperforms more complex algorithms, and how it adapts across major programming languages.

A practical, language-spanning exploration of Insertion Sort, including its invariant, complexity, performance, pseudocode, diagrams, and full implementations.

Transform from solo contributor to Software Architect leading an army of AI agents. Learn why deep knowledge of software development best practices is essential for driving standards across the full software development lifecycle and leading AI agent teams effectively.

Transform from solo contributor to Software Architect leading AI agent teams. Learn why deep knowledge of best practices is key for driving SDLC standards.

From Developer to Software Architect: Leading AI Agents

A clear, language-spanning walkthrough of the simplest sorting algorithm in computer science—why it works, where it fails, and what it still teaches us today.

Why amateur radio operators, satellite internet users, and the scientific  community must work together to reduce unintended radio emissions from low-Earth orbit  satellites.

Amateur radio operators, satellite internet users, and scientists must work  together to reduce unintended radio emissions from low-Earth orbit satellites.

Protecting the Quiet Sky: Curbing Satellite Radio Emissions

Protecting the Quiet Sky: How We Can Curb Unintended Satellite Radio Emissions

A practical, language-spanning tour of what algorithms are, how they’re structured, why Big-O matters, and how to implement and analyze a simple min/max routine from pseudocode to production-grade code.

A language-spanning tour of what algorithms are, why Big-O matters, and how to implement and analyze a min/max routine from pseudocode to production-grade code.

What Is an Algorithm? The Soul of Every Program Guide

Browse articles on software engineering, computer science, algorithms, AI-assisted development, and engineering practices - Page 3

Engineering Log

15 Articles Found

Bubble Sort: The Gentle Art of Getting Things in Order

Protecting the Quiet Sky: How We Can Curb Unintended Satellite Radio Emissions

What Is an Algorithm? The Soul of Every Program