<?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>Engineering on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/engineering/</link><description>Recent content in Engineering on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Tue, 09 Dec 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/engineering/index.xml" rel="self" type="application/rss+xml"/><item><title>Sorting Series (Final): Practical Selection - Choose by Scale, Stability, Memory, Distribution</title><link>https://shio-chan-dev.github.io/jeanblog/alg/sorting/9.sorting-series-selection-guide/</link><pubDate>Tue, 09 Dec 2025 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/sorting/9.sorting-series-selection-guide/</guid><description>Practical selection guide: decision tables by scale/distribution/stability/memory, engineering scenarios, test checklist, and common pitfalls to apply the series.</description></item><item><title>Do Not Let AI Drive You: Keep the Ability to Build Independently</title><link>https://shio-chan-dev.github.io/jeanblog/thoughts/thoughts/ai-usage-self-control/</link><pubDate>Mon, 08 Dec 2025 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/thoughts/thoughts/ai-usage-self-control/</guid><description>How to avoid copy-paste dependence when using AI for coding: Feynman technique, deliberate practice, retrieval practice, and a practical self-check workflow.</description></item><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>