<?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>算法 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/%E7%AE%97%E6%B3%95/</link><description>Recent content in 算法 on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>zh-cn</language><lastBuildDate>Fri, 20 Mar 2026 14:44:10 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E7%AE%97%E6%B3%95/index.xml" rel="self" type="application/rss+xml"/><item><title>先写骨架，再补细节：用契约拆解算法题与中型程序</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/skeleton-first-contract-driven-coding/</link><pubDate>Fri, 20 Mar 2026 14:44:10 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/skeleton-first-contract-driven-coding/</guid><description>把复杂程序拆成骨架、契约和原子状态变换：本文用 LRUCache、下单流程与反例解释为什么先写外部结构通常更稳，以及 helper 应该如何控制副作用。</description></item><item><title>手写一个基础消息代理：发布、订阅、重试与失败契约</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/basic-message-broker/</link><pubDate>Sat, 28 Feb 2026 11:03:15 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/basic-message-broker/</guid><description>从发布订阅到重试与失败契约，系统讲解基础消息代理的实现与工程边界。</description></item><item><title>“喜欢这个的人也喜欢…”：电商推荐的最小实现</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/architecture/recommendation-people-also-like/</link><pubDate>Sat, 24 Jan 2026 13:27:25 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/architecture/recommendation-people-also-like/</guid><description>用协同过滤的简化模型实现“相似商品推荐”。</description></item><item><title>从 REPL 到逆波兰计算器：一步步扩展交互程序</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/repl-to-rpn-calculator/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/repl-to-rpn-calculator/</guid><description>从最小可用 REPL 开始，逐步演化为逆波兰表达式计算器。</description></item><item><title>如何排序 10GB 文件：外部排序的工程方案</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/sort-10gb-file/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/sort-10gb-file/</guid><description>解释外部排序的流程、分块策略与磁盘 I/O 优化。</description></item><item><title>如何排序 10TB 数据：分布式排序思路</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/sort-10tb-data/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/sort-10tb-data/</guid><description>介绍大规模分布式排序的基本流程与工程考量。</description></item><item><title>如何设计磁盘碎片整理：目标、步骤与权衡</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/filesystem-defragmentation-design/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/filesystem-defragmentation-design/</guid><description>从工程角度设计碎片整理流程，并给出简化可运行示例。</description></item><item><title>实现 rnd()：从基础随机数到可控随机</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/implement-rnd-function/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/implement-rnd-function/</guid><description>解释随机数生成的基本思路，并用线性同余法实现一个简单 rnd()。</description></item><item><title>手写一个最小的垃圾回收器：标记-清除模型</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/simple-garbage-collector/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/simple-garbage-collector/</guid><description>用最小示例解释标记-清除 GC 的核心思路。</description></item><item><title>随机迷宫生成：深度优先回溯法</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/random-maze-generator/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/random-maze-generator/</guid><description>用深度优先回溯生成迷宫，并提供可运行示例。</description></item><item><title>随机生成不重复序列：洗牌法与采样法</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/random-unique-sequence/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/random-unique-sequence/</guid><description>解释如何生成不重复随机序列，并给出洗牌法实现。</description></item><item><title>尾递归阶乘：把递归变成可优化形式</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/tail-recursive-factorial/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/tail-recursive-factorial/</guid><description>通过尾递归形式实现阶乘，并讨论实际语言支持情况。</description></item><item><title>写一个基础 Web 服务器：最小可用实现</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/basic-web-server/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/basic-web-server/</guid><description>用最小可运行示例解释 HTTP 服务的核心流程。</description></item><item><title>用队列实现栈：单队列旋转法</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/queue-to-stack/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/queue-to-stack/</guid><description>解释如何用队列模拟栈，并给出可运行实现与复杂度分析。</description></item><item><title>用栈实现队列：双栈法的思路与实现</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/stack-to-queue/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/stack-to-queue/</guid><description>解释如何用两个栈模拟队列，并给出可运行实现与复杂度分析。</description></item><item><title>栈溢出示例：递归深度与调用栈的边界</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/stack-overflow-example/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/stack-overflow-example/</guid><description>展示栈溢出的典型示例，并解释成因与规避方法。</description></item><item><title>什么是 Wait-Free 算法：并发中的最高进度保证</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/wait-free-algorithms/</link><pubDate>Sat, 24 Jan 2026 13:08:42 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/wait-free-algorithms/</guid><description>解释 wait-free 的含义，与 lock-free/obstruction-free 的区别，并给出实践理解。</description></item></channel></rss>