<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Complexity on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/complexity/</link><description>Recent content in Complexity on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Mon, 01 Dec 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/complexity/index.xml" rel="self" type="application/rss+xml"/><item><title>Sorting Series (1): How to Choose an Algorithm - Time, Space, Stability, Scenarios</title><link>https://shio-chan-dev.github.io/jeanblog/alg/sorting/1.sorting-series-preface/</link><pubDate>Mon, 01 Dec 2025 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/sorting/1.sorting-series-preface/</guid><description>Use the ACERS template to map common sorting algorithms by scenario, complexity, stability, and engineering usage, with runnable examples and a selection checklist.</description></item></channel></rss>