Algorithms

Algorithms series covering sorting algorithms, algorithm fundamentals, and problem-solving. Learn bubble sort, insertion sort, selection sort, and merge sort.

6 articles in series

Abstract geometric flow of Inputs → Process → Outputs in a minimalist Solarized palette

Series: Algorithms (Part 1)

What Is an Algorithm? The Soul of Every Program

November 11, 2025·byJoshua Morris

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.

Computer ScienceAlgorithms

Clean editorial illustration of a messy spreadsheet gradually organizing itself row by row as arrows indicate comparisons and swaps

Series: Algorithms (Part 2)

Bubble Sort: The Gentle Art of Getting Things in Order

November 28, 2025·byJoshua Morris

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.

Computer ScienceAlgorithms

Minimalist diagram showing one element sliding left into a sorted prefix, styled in a Solarized palette.

Series: Algorithms (Part 3)

Insertion Sort: Building Order One Element at a Time

December 9, 2025·byJoshua Morris

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.

Computer ScienceAlgorithms

Minimalist diagram of a highlighted minimum element being selected from a row of numbers, styled in a Solarized palette.

Series: Algorithms (Part 4)

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

December 22, 2025·byJoshua Morris

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.

Computer ScienceAlgorithms

Abstract visualization of dividing data into halves and merging them back in sorted order

Series: Algorithms (Part 5)

Merge Sort: Divide, Conquer, and Rebuild Order

December 29, 2025·byJoshua Morris

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.

Computer ScienceAlgorithms

Abstract geometric visualization of elements partitioning around a pivot

Series: Algorithms (Part 6)

Quick Sort: Order Through Partition

January 2, 2026·byJoshua Morris

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.

Computer ScienceAlgorithms

Back to All Series