<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
    <channel>
        <title>算法 - 标签 - 五岁博客</title>
        <link>https://fiveyoboy.com/tags/%E7%AE%97%E6%B3%95/</link>
        <description>算法 - 标签 - 五岁博客</description>
        <generator>Hugo -- gohugo.io</generator><language>zh-CN</language><managingEditor>fiveyoboy@qq.com (五岁博客)</managingEditor>
            <webMaster>fiveyoboy@qq.com (五岁博客)</webMaster><lastBuildDate>Thu, 20 Aug 2026 00:00:00 &#43;0000</lastBuildDate><atom:link href="https://fiveyoboy.com/tags/%E7%AE%97%E6%B3%95/" rel="self" type="application/rss+xml" /><item>
    <title>时间复杂度和空间复杂度怎么算？大 O 表示法看完就懂</title>
    <link>https://fiveyoboy.com/articles/time-and-space-complexity/</link>
    <pubDate>Thu, 20 Aug 2026 00:00:00 &#43;0000</pubDate>
    <author>五岁博客</author>
    <guid>https://fiveyoboy.com/articles/time-and-space-complexity/</guid>
    <description><![CDATA[<p>刚开始学算法那会儿，我老把时间复杂度和空间复杂度搞混，背了一堆 O(n)、O(log n) 却不知道怎么从代码里推出来。</p>
<p>这篇就把怎么算讲清楚，全程用 Go 代码举例，看完你自己就能估算一段代码跑得快不快、占多少内存。</p>]]></description>
</item>
</channel>
</rss>
