<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <author>
    <name>Samuel Pang</name>
  </author>
  <generator uri="https://hexo.io/">Hexo</generator>
  <id>http://blog.unazoomer.xyz/</id>
  <link href="http://blog.unazoomer.xyz/" rel="alternate"/>
  <link href="http://blog.unazoomer.xyz/atom.xml" rel="self"/>
  <rights>All rights reserved 2026, Samuel Pang</rights>
  <title>SY's Webpage</title>
  <updated>2026-11-16T08:53:36.437Z</updated>
  <entry>
    <author>
      <name>Samuel Pang</name>
    </author>
    <category term="教程" scheme="http://blog.unazoomer.xyz/categories/%E6%95%99%E7%A8%8B/"/>
    <category term="Magpie" scheme="http://blog.unazoomer.xyz/tags/Magpie/"/>
    <category term="Docker" scheme="http://blog.unazoomer.xyz/tags/Docker/"/>
    <content>
      <![CDATA[<p>本地magpie接入vps中的magpie服务</p><h2 id="搭建magpie"><a href="#搭建magpie" class="headerlink" title="搭建magpie"></a>搭建magpie</h2><ol><li>搭建项目结构</li></ol><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">mkdir</span> -p /opt/magpie/config</span><br><span class="line"><span class="built_in">chown</span> 65532:65532 /opt/magpie/config</span><br><span class="line"><span class="built_in">chown</span> 700 /opt/magpie/config</span><br></pre></td></tr></table></figure><p>目录结构</p><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line">/opt/magpie/</span><br><span class="line">├── compose.yaml</span><br><span class="line">└── config/</span><br></pre></td></tr></table></figure><ol start="2"><li>创建配置文件</li></ol><ul><li>生成<code>compose.yaml</code>文件</li></ul><figure class="highlight yaml"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br></pre></td><td class="code"><pre><span class="line"><span class="attr">services:</span></span><br><span class="line">  <span class="attr">magpie:</span></span><br><span class="line">    <span class="attr">image:</span> <span class="string">ghcr.io/yetone/magpie:latest</span></span><br><span class="line">    <span class="attr">container_name:</span> <span class="string">magpie</span></span><br><span class="line">    <span class="attr">restart:</span> <span class="string">unless-stopped</span></span><br><span class="line"></span><br><span class="line">    <span class="attr">ports:</span></span><br><span class="line">      <span class="bullet">-</span> <span class="string">&quot;127.0.0.1:3425:3425&quot;</span></span><br><span class="line">      <span class="bullet">-</span> <span class="string">&quot;127.0.0.1:3430:3430&quot;</span></span><br><span class="line"></span><br><span class="line">    <span class="attr">environment:</span></span><br><span class="line">      <span class="attr">MAGPIE_WEB_KEY:</span> <span class="string">$&#123;MAGPIE_WEB_KEY&#125;</span></span><br><span class="line">      <span class="attr">magpie_public_url:</span> <span class="string">&quot;https://magpie.codeshot.xyz&quot;</span></span><br><span class="line">      <span class="attr">DO_NOT_TRACK:</span> <span class="string">&quot;1&quot;</span></span><br><span class="line"></span><br><span class="line">    <span class="attr">volumes:</span></span><br><span class="line">      <span class="bullet">-</span> <span class="string">./config:/config</span></span><br><span class="line"></span><br><span class="line">    <span class="attr">command:</span> [<span class="string">web</span>, <span class="string">--addr</span>, <span class="number">0.0</span><span class="number">.0</span><span class="number">.0</span><span class="string">:3430</span>, <span class="string">--no-open</span>]</span><br></pre></td></tr></table></figure><ul><li>生成web key</li></ul><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">echo</span> <span class="string">&quot;MAGPIE_WEB_KEY=<span class="subst">$(openssl rand -hex 24)</span>&quot;</span> &gt; .<span class="built_in">env</span></span><br></pre></td></tr></table></figure><ol start="3"><li>启动服务</li></ol><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">docker compose up -d</span><br></pre></td></tr></table></figure><ol start="4"><li>配置服务商</li></ol><p>ssh tunel访问web管理页面</p><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">ssh -N -L 3430:127.0.0.1:3430 vps-rn-la-01</span><br></pre></td></tr></table></figure><p>浏览器访问<code>127.0.0.1:3430</code>，输入前面生成的web key</p><ul><li>添加provider</li><li>生成<code>gateway key</code></li></ul><p>验证访问</p><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">curl -fsS https://magpie.codeshot.xyz/v1/models \</span><br><span class="line">  -H <span class="string">&quot;Authorization: Bearer <span class="variable">$&#123;MAGPIE_GATEWAY_KEY&#125;</span>&quot;</span></span><br></pre></td></tr></table></figure><p>后期升级镜像</p><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">docker compose pull &amp;&amp; docker compose up -d</span><br></pre></td></tr></table></figure><h2 id="模型提供方管理"><a href="#模型提供方管理" class="headerlink" title="模型提供方管理"></a>模型提供方管理</h2><p>安装magpie cli</p><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">yay -S magpie-cli-bin</span><br></pre></td></tr></table></figure><p>设置软链接</p><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">ln</span> -s /usr/bin/magpie-cli ~/.local/bin/magpie</span><br></pre></td></tr></table></figure><ol><li>添加远程提供商</li></ol><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">magpie provider add remote-magpie <span class="string">&quot;<span class="variable">$&#123;MAGPIE_GATEWAY_KEY&#125;</span>&quot;</span> url=https://magpie.codeshot.xyz <span class="built_in">id</span>=vps</span><br></pre></td></tr></table></figure><p>测试连通性</p><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">magpie provider <span class="built_in">test</span> vps</span><br></pre></td></tr></table></figure><ol start="2"><li>获取远程模型列表</li></ol><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">magpie models</span><br></pre></td></tr></table></figure><p>新增模型&#x2F;路由组后，本地刷新</p><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">magpie provider refresh vps</span><br></pre></td></tr></table></figure><h2 id="配置模型"><a href="#配置模型" class="headerlink" title="配置模型"></a>配置模型</h2><ul><li>具体模型</li></ul><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">magpie claude Id/provider/modelId</span><br></pre></td></tr></table></figure><ul><li>路由组</li></ul><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">magpie claude Id/group/groupId</span><br></pre></td></tr></table></figure><p>恢复原来的配置</p><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">magpie claude default</span><br></pre></td></tr></table></figure><p>查看本机检测到的agents及当前配置</p><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">mapgie <span class="built_in">ls</span></span><br></pre></td></tr></table></figure><p>查看支持的coding agents</p><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">magpie agents</span><br></pre></td></tr></table></figure><h2 id="服务管理"><a href="#服务管理" class="headerlink" title="服务管理"></a>服务管理</h2><ul><li>临时启动服务</li></ul><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">magpie serve</span><br></pre></td></tr></table></figure><ul><li>后台daemon运行</li></ul><p>安装并启动后台服务</p><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">magpie daemon install</span><br></pre></td></tr></table></figure><p>查看服务状态</p><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">magpie daemon status</span><br></pre></td></tr></table></figure><h2 id="自定义"><a href="#自定义" class="headerlink" title="自定义"></a>自定义</h2><p>推荐配置：</p><ul><li>关闭统计上传</li></ul><p>在<code>~/.config/magpie/settings.json</code>中配置：</p><figure class="highlight json"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"><span class="punctuation">&#123;</span></span><br><span class="line">  <span class="attr">&quot;noStats&quot;</span><span class="punctuation">:</span> <span class="literal"><span class="keyword">true</span></span></span><br><span class="line"><span class="punctuation">&#125;</span></span><br></pre></td></tr></table></figure><ul><li>关闭自动更新</li></ul><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">magpie update auto off</span><br></pre></td></tr></table></figure><ul><li>关闭账号发现</li></ul><figure class="highlight sh"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">magpie accounts discovery off</span><br></pre></td></tr></table></figure><blockquote><p>Tips: 通过命令来控制的开关，可以去掉末尾的on&#x2F;off来查看配置项的状态</p></blockquote><p>完整配置：</p><figure class="highlight json"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line"><span class="punctuation">&#123;</span></span><br><span class="line">  <span class="attr">&quot;noStats&quot;</span><span class="punctuation">:</span> <span class="literal"><span class="keyword">true</span></span><span class="punctuation">,</span></span><br><span class="line">  <span class="attr">&quot;noAutoUpdate&quot;</span><span class="punctuation">:</span> <span class="literal"><span class="keyword">true</span></span><span class="punctuation">,</span></span><br><span class="line">  <span class="attr">&quot;noAccountDiscovery&quot;</span><span class="punctuation">:</span> <span class="literal"><span class="keyword">true</span></span></span><br><span class="line"><span class="punctuation">&#125;</span></span><br></pre></td></tr></table></figure>]]>
    </content>
    <id>http://blog.unazoomer.xyz/posts/f8dfe763/</id>
    <link href="http://blog.unazoomer.xyz/posts/f8dfe763/"/>
    <published>2026-11-16T08:53:36.437Z</published>
    <summary>
      <![CDATA[<p>本地magpie接入vps中的magpie服务</p>]]>
    </summary>
    <title>magpie部署教程</title>
    <updated>2026-11-16T08:53:36.437Z</updated>
  </entry>
  <entry>
    <author>
      <name>Samuel Pang</name>
    </author>
    <content>
      <![CDATA[<p>Welcome to <a href="https://hexo.io/">Hexo</a>! This is your very first post. Check <a href="https://hexo.io/docs/">documentation</a> for more info. If you get any problems when using Hexo, you can find the answer in <a href="https://hexo.io/docs/troubleshooting.html">troubleshooting</a> or you can ask me on <a href="https://github.com/hexojs/hexo/issues">GitHub</a>.</p><h2 id="Quick-Start"><a href="#Quick-Start" class="headerlink" title="Quick Start"></a>Quick Start</h2><h3 id="Create-a-new-post"><a href="#Create-a-new-post" class="headerlink" title="Create a new post"></a>Create a new post</h3><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">$ hexo new <span class="string">&quot;My New Post&quot;</span></span><br></pre></td></tr></table></figure><p>More info: <a href="https://hexo.io/docs/writing.html">Writing</a></p><h3 id="Run-server"><a href="#Run-server" class="headerlink" title="Run server"></a>Run server</h3><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">$ hexo server</span><br></pre></td></tr></table></figure><p>More info: <a href="https://hexo.io/docs/server.html">Server</a></p><h3 id="Generate-static-files"><a href="#Generate-static-files" class="headerlink" title="Generate static files"></a>Generate static files</h3><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">$ hexo generate</span><br></pre></td></tr></table></figure><p>More info: <a href="https://hexo.io/docs/generating.html">Generating</a></p><h3 id="Deploy-to-remote-sites"><a href="#Deploy-to-remote-sites" class="headerlink" title="Deploy to remote sites"></a>Deploy to remote sites</h3><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">$ hexo deploy</span><br></pre></td></tr></table></figure><p>More info: <a href="https://hexo.io/docs/one-command-deployment.html">Deployment</a></p>]]>
    </content>
    <id>http://blog.unazoomer.xyz/posts/4a17b156/</id>
    <link href="http://blog.unazoomer.xyz/posts/4a17b156/"/>
    <published>2026-11-16T08:53:36.204Z</published>
    <summary>
      <![CDATA[<p>Welcome to <a href="https://hexo.io/">Hexo</a>! This is your very first post. Check <a href="https://hexo.io/docs/">documentation</a> for more info. If you get any problems when using Hexo, you can find the answer in <a href="https://hexo.io/docs/troubleshooting.html">troubleshooting</a> or you can ask me on <a href="https://github.com/hexojs/hexo/issues">GitHub</a>.</p>]]>
    </summary>
    <title>Hello World</title>
    <updated>2026-11-16T08:53:36.204Z</updated>
  </entry>
  <entry>
    <author>
      <name>Samuel Pang</name>
    </author>
    <category term="algorithm" scheme="http://blog.unazoomer.xyz/categories/algorithm/"/>
    <category term="algorithm" scheme="http://blog.unazoomer.xyz/tags/algorithm/"/>
    <category term="sorting" scheme="http://blog.unazoomer.xyz/tags/sorting/"/>
    <content>
      <![CDATA[<p>下面的这些排序算法可以在<a href="https://leetcode.com/problems/sort-an-array/">leetcode 912. Sort an Array</a>练习</p><h2 id="Prerequisites"><a href="#Prerequisites" class="headerlink" title="Prerequisites"></a>Prerequisites</h2><p>排序算法的稳定性：</p><p>数值相同的元素在排序前后相对位置不变，则称算法稳定。如果只是针对数值类型，谈论稳定性没有意义，稳定性针对有对个属性的对象类型而言。</p><h2 id="基于比较的排序算法"><a href="#基于比较的排序算法" class="headerlink" title="基于比较的排序算法"></a>基于比较的排序算法</h2><h3 id="基础排序算法"><a href="#基础排序算法" class="headerlink" title="基础排序算法"></a>基础排序算法</h3><h4 id="冒泡排序"><a href="#冒泡排序" class="headerlink" title="冒泡排序"></a>冒泡排序</h4><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">bubbleSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums)</span> </span>&#123;</span><br><span class="line">    <span class="type">int</span> N = nums.<span class="built_in">size</span>();</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = <span class="number">0</span>; i &lt; N - <span class="number">1</span>; i++) &#123;</span><br><span class="line">        <span class="keyword">for</span> (<span class="type">int</span> j = <span class="number">1</span>; j &lt; N - i; j++) &#123;</span><br><span class="line">            <span class="keyword">if</span> (nums[j - <span class="number">1</span>] &gt; nums[j]) &#123;</span><br><span class="line">                <span class="built_in">swap</span>(nums[j - <span class="number">1</span>], nums[j]);</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><p>优化思路：如果在某一轮扫描中，没有发生元素交换，说明元素已经有序，提前终止程序。</p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">bubbleSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums)</span> </span>&#123;</span><br><span class="line">    <span class="type">int</span> N = nums.<span class="built_in">size</span>();</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = <span class="number">0</span>; i &lt; N - <span class="number">1</span>; i++) &#123;</span><br><span class="line">        <span class="type">bool</span> sorted = <span class="literal">true</span>;</span><br><span class="line">        <span class="keyword">for</span> (<span class="type">int</span> j = <span class="number">1</span>; j &lt; N - i; j++) &#123;</span><br><span class="line">            <span class="keyword">if</span> (nums[j - <span class="number">1</span>] &gt; nums[j]) &#123;</span><br><span class="line">                <span class="built_in">swap</span>(nums[j - <span class="number">1</span>], nums[j]);</span><br><span class="line">                sorted = <span class="literal">false</span>;</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        <span class="keyword">if</span> (sorted) &#123;</span><br><span class="line">            <span class="keyword">return</span>;</span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><p>复杂度分析：</p><ul><li><p>时间复杂度：$O(n^2)$</p></li><li><p>空间复杂度：$O(1)$</p></li></ul><p>稳定性: 算法稳定。</p><h4 id="简单选择排序"><a href="#简单选择排序" class="headerlink" title="简单选择排序"></a>简单选择排序</h4><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">selectionSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums)</span> </span>&#123;</span><br><span class="line">    <span class="type">int</span> len = nums.<span class="built_in">size</span>();</span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = <span class="number">0</span>; i &lt; len - <span class="number">1</span>; i++) &#123;</span><br><span class="line">        <span class="type">int</span> min = i;</span><br><span class="line">        <span class="keyword">for</span> (<span class="type">int</span> j= i + <span class="number">1</span>; j &lt; len &amp;&amp; nums[j] &lt; nums[min]; j++) &#123;</span><br><span class="line">            min = j</span><br><span class="line">        &#125;</span><br><span class="line">        <span class="keyword">if</span> (min != i) <span class="built_in">swap</span>(nums[i], num[min]);</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><p>优化方向：从未排好序的部分选出最值元素，可以利用优先队列快速找出最值。</p><p>复杂度分析：</p><ul><li><p>时间复杂度：$O(n^2)$</p></li><li><p>空间复杂度：$O(1)$</p></li></ul><p>稳定性: 算法不稳定，不管待排序序列是否有序，时间复杂度恒定不变。</p><h4 id="插入排序"><a href="#插入排序" class="headerlink" title="插入排序"></a>插入排序</h4><ul><li><p>Approach 1: 逐个交换</p><p>逐个向左比较，交换到合适位置，缺点是交换次数太多</p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">insertionSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums)</span> </span>&#123;</span><br><span class="line">    <span class="type">int</span> N = nums.<span class="built_in">size</span>();</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = <span class="number">1</span>; i &lt; N; i++) &#123;</span><br><span class="line">        <span class="keyword">for</span> (<span class="type">int</span> j = i; j &gt; <span class="number">0</span> &amp;&amp; nums[j - <span class="number">1</span>] &gt; nums[j]; j--) &#123;</span><br><span class="line">            <span class="built_in">swap</span>(nums[j - <span class="number">1</span>], nums[j]);</span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure></li><li><p>Approach 2: 逐个赋值</p><p>先暂存，前面比暂存元素严格小的元素逐个后移，只有比较和赋值，没有交换操作</p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">insertionSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums)</span> </span>&#123;</span><br><span class="line">    <span class="type">int</span> N = nums.<span class="built_in">size</span>();</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = <span class="number">1</span>; i &lt; N; i++) &#123;</span><br><span class="line">        <span class="type">int</span> x = nums[i];</span><br><span class="line">        <span class="type">int</span> j = i - <span class="number">1</span>;             <span class="comment">/* j表示已排序元素中最后一个不大于x的位置 */</span></span><br><span class="line"></span><br><span class="line">        <span class="keyword">while</span> (j &gt;= <span class="number">0</span> &amp;&amp; nums[j] &gt; x) &#123;</span><br><span class="line">            nums[j + <span class="number">1</span>] = nums[j];</span><br><span class="line">            j--;</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        nums[j + <span class="number">1</span>] = x;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure></li></ul><p>总结：</p><ul><li><p>优点：</p><ul><li><p>插入排序作用在接近有序的数组上效果较好。</p></li><li><p>插入排序作用在规模较小的数组上效果较好。</p></li></ul></li><li><p>缺点：</p><ul><li>数值很小的元素排在很后面</li><li>数值很大的元素排在很前面</li></ul></li><li><p>高级排序算法的底层会转向使用插入排序。</p></li></ul><blockquote><p>在绝大多数情况下，插入排序应用长度为6到16之间的任意值的排序任务上面都能令人满意。<br>——《Algorithms(4th Edition)》</p></blockquote><p>复杂度分析：</p><ul><li><p>时间复杂度：$O(n^2)$</p></li><li><p>空间复杂度：$O(1)$</p></li></ul><p>稳定性: 算法稳定。</p><h4 id="希尔排序"><a href="#希尔排序" class="headerlink" title="希尔排序"></a>希尔排序</h4><p>本质：分组插入排序、带间隔的插入排序</p><p>利用了插入排序的优点，回避了插入排序的缺点。</p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">shellSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums)</span> </span>&#123;</span><br><span class="line">    <span class="type">int</span> len = nums.<span class="built_in">size</span>();</span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> delta = len / <span class="number">2</span>; delta &gt; <span class="number">0</span>; delta /= <span class="number">2</span>) &#123;</span><br><span class="line">        <span class="keyword">for</span> (<span class="type">int</span> start = <span class="number">0</span>; start &lt; delta; start++) &#123;</span><br><span class="line">            <span class="comment">// 分组插入排序</span></span><br><span class="line">            <span class="keyword">for</span> (<span class="type">int</span> i = start + delta; i &lt; len; i += delta) &#123;</span><br><span class="line">                <span class="type">int</span> temp = nums[i];</span><br><span class="line">                <span class="type">int</span> j;</span><br><span class="line">                <span class="keyword">for</span> (j = i; j - delta &gt;= <span class="number">0</span> &amp;&amp; nums[j - delta] &gt; temp; j -= delta) &#123;</span><br><span class="line">                    nums[j] = nums[j - delta];</span><br><span class="line">                &#125;</span><br><span class="line">                nums[j] = temp;</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><p>复杂度分析：</p><ul><li><p>时间复杂度：与选择的步长序列有关</p></li><li><p>空间复杂度：$O(1)$</p></li></ul><p>稳定性: 算法不稳定。</p><h3 id="高级排序算法"><a href="#高级排序算法" class="headerlink" title="高级排序算法"></a>高级排序算法</h3><h4 id="快速排序"><a href="#快速排序" class="headerlink" title="快速排序"></a>快速排序</h4><p>基本思想：分而治之</p><ol><li>单路快排</li></ol><ul><li><p>第一个数组元素作为<code>pivot</code></p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">quickSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> left, <span class="type">int</span> right)</span> </span>&#123;</span><br><span class="line">    <span class="keyword">if</span> (left &gt;= right) &#123;</span><br><span class="line">        <span class="keyword">return</span>;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="type">int</span> index = <span class="built_in">partition</span>(nums, left, right);</span><br><span class="line">    <span class="built_in">quickSort</span>(nums, left, index - <span class="number">1</span>);</span><br><span class="line">    <span class="built_in">quickSort</span>(nums, index + <span class="number">1</span>, right);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="type">int</span> <span class="title">partition</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> left, <span class="type">int</span> right)</span> </span>&#123;</span><br><span class="line">    <span class="type">int</span> pivot = nums[left];</span><br><span class="line">    <span class="type">int</span> j = left;                       <span class="comment">/* j表示小于等于pivot区间的最后一个元素 */</span></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = left + <span class="number">1</span>; i &lt;= right; i++) &#123;</span><br><span class="line">        <span class="keyword">if</span> (nums[i] &lt;= pivot) &#123;        <span class="comment">/* 大放过，小向前 */</span></span><br><span class="line">            j++;</span><br><span class="line">            <span class="built_in">swap</span>(nums[i], nums[j]);</span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="built_in">swap</span>(nums[left], nums[j]);</span><br><span class="line">    <span class="keyword">return</span> j;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure></li><li><p>最后一个数组元素作为<code>pivot</code></p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">quickSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> hi)</span> </span>&#123;</span><br><span class="line">    <span class="keyword">if</span> (lo &gt;= hi) <span class="keyword">return</span>;</span><br><span class="line">    <span class="type">int</span> index = <span class="built_in">partition</span>(nums, lo, hi);</span><br><span class="line">    <span class="built_in">quickSort</span>(nums, lo, index - <span class="number">1</span>);</span><br><span class="line">    <span class="built_in">quickSort</span>(nums, index + <span class="number">1</span>, hi);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="type">int</span> <span class="title">partition</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> hi)</span> </span>&#123;</span><br><span class="line">    <span class="type">int</span> pivot = nums[hi];</span><br><span class="line">    <span class="type">int</span> j = lo - <span class="number">1</span>;                    <span class="comment">/* j表示小于等于pivot区间的最后一个元素 */</span></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = lo; i &lt; hi; i++) &#123;</span><br><span class="line">        <span class="keyword">if</span> (nums[i] &lt;= pivot) &#123;        <span class="comment">/* 大放过，小向前 */</span></span><br><span class="line">            j++;</span><br><span class="line">            <span class="built_in">swap</span>(nums[j], nums[i]);</span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="built_in">swap</span>(nums[j + <span class="number">1</span>], nums[hi]);</span><br><span class="line">    <span class="keyword">return</span> j + <span class="number">1</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure></li></ul><p>优化思路：</p><p><code>partition</code>操作在「顺序数组」和「逆序数组」上表现很差，这一点与插入排序相反。理想快速排序类似于递归树平衡，每次划分完元素的最终位置尽可能靠中间。因此我们可以随机选择<code>pivot</code>元素，打破顺序性。但是随机选择切分元素还会遇到一些问题，例如数组中存在多元素值相同，这样随机选择就没有意义，如何处理值相同的元素又成为了一个问题，所以有了以下两种方法来解决这种问题。</p><ol start="2"><li>双路快排</li></ol><p>把与<code>pivot</code>相等的元素平均地放到数组的两侧</p><ul><li><p>Approach 1</p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">quickSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> hi)</span> </span>&#123;</span><br><span class="line">    <span class="keyword">if</span> (lo &gt;= hi) <span class="keyword">return</span>;</span><br><span class="line">    <span class="type">int</span> index = <span class="built_in">partition</span>(nums, lo, hi);</span><br><span class="line">    <span class="built_in">quickSort</span>(nums, lo, index - <span class="number">1</span>);</span><br><span class="line">    <span class="built_in">quickSort</span>(nums, index + <span class="number">1</span>, hi);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="type">int</span> <span class="title">partition</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> hi)</span> </span>&#123;</span><br><span class="line">    <span class="built_in">srand</span>((<span class="type">unsigned</span>) <span class="built_in">time</span>(<span class="literal">NULL</span>));</span><br><span class="line">    <span class="type">int</span> randomIndex = lo + <span class="built_in">rand</span>() % (hi - lo + <span class="number">1</span>);</span><br><span class="line">    <span class="built_in">swap</span>(nums[lo], nums[randomIndex]);</span><br><span class="line">    <span class="type">int</span> pivot = nums[lo];</span><br><span class="line"></span><br><span class="line">    <span class="type">int</span> le = lo + <span class="number">1</span>;            <span class="comment">/* [lo+1, le) */</span></span><br><span class="line">    <span class="type">int</span> ge = hi;                <span class="comment">/* (ge, hi] */</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">while</span> (<span class="literal">true</span>) &#123;</span><br><span class="line">        <span class="keyword">while</span> (le &lt;= hi &amp;&amp; nums[le] &lt; pivot) le++;</span><br><span class="line">        <span class="keyword">while</span> (ge &gt;= lo &amp;&amp; nums[ge] &gt; pivot) ge--;</span><br><span class="line">        <span class="keyword">if</span> (le &gt;= ge) <span class="keyword">break</span>;</span><br><span class="line">        <span class="built_in">swap</span>(nums[le++], nums[ge--]);</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="built_in">swap</span>(nums[lo], nums[ge]);</span><br><span class="line">    <span class="keyword">return</span> ge;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure></li><li><p>Approach 2:</p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">quickSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> hi)</span> </span>&#123;</span><br><span class="line">    <span class="keyword">if</span> (lo &gt;= hi) <span class="keyword">return</span>;</span><br><span class="line">    <span class="type">int</span> pivot_index = <span class="built_in">partition</span>(nums, lo, hi);</span><br><span class="line">    <span class="built_in">quickSort</span>(nums, lo, pivot_index - <span class="number">1</span>);</span><br><span class="line">    <span class="built_in">quickSort</span>(nums, pivot_index + <span class="number">1</span>, hi);</span><br><span class="line"></span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="type">int</span> <span class="title">partition</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> hi)</span> </span>&#123;</span><br><span class="line">    <span class="built_in">srand</span>((<span class="type">unsigned</span>) <span class="built_in">time</span>(<span class="literal">NULL</span>));</span><br><span class="line">    <span class="type">int</span> randomInt = lo + <span class="built_in">rand</span>() % (hi - lo + <span class="number">1</span>);</span><br><span class="line">    <span class="built_in">swap</span>(nums[lo], nums[randomInt]);</span><br><span class="line"></span><br><span class="line">    <span class="type">int</span> i = lo;                  <span class="comment">/* i表示等于pivot元素区间的第一个位置 */</span></span><br><span class="line">    <span class="type">int</span> j = hi + <span class="number">1</span>;              <span class="comment">/* j表示严格大于pivot区间的第一个元素的位置 */</span></span><br><span class="line">    <span class="type">int</span> pivot = nums[lo];</span><br><span class="line">    <span class="keyword">while</span>(<span class="literal">true</span>) &#123;</span><br><span class="line">        <span class="keyword">while</span> (nums[++i] &lt; pivot) <span class="keyword">if</span> (i == hi) <span class="keyword">break</span>;</span><br><span class="line">        <span class="keyword">while</span> (nums[--j] &gt; pivot) <span class="keyword">if</span> (j == lo) <span class="keyword">break</span>;</span><br><span class="line">        <span class="keyword">if</span> (i &gt;= j) <span class="keyword">break</span>;</span><br><span class="line">        <span class="built_in">swap</span>(nums[i], nums[j];)</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="built_in">swap</span>(nums[lo], nums[j]);</span><br><span class="line">    <span class="keyword">return</span> j;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><blockquote><p>From 《Algorithms, 4th Edition》</p></blockquote></li></ul><ol start="3"><li>三路快排</li></ol><p>把与<code>pivot</code>相等的元素挤到中间</p><ul><li><p>Approach 1: 交换的同时处理<code>pivot</code>元素</p>  <figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">quickSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> hi)</span> </span>&#123;</span><br><span class="line">    <span class="keyword">if</span> (lo &gt;= hi) <span class="keyword">return</span>;</span><br><span class="line"></span><br><span class="line">    <span class="built_in">srand</span>((<span class="type">unsigned</span>) <span class="built_in">time</span>(<span class="literal">NULL</span>));</span><br><span class="line">    <span class="type">int</span> randomIndex = lo + <span class="built_in">rand</span>() % (hi - lo + <span class="number">1</span>);</span><br><span class="line">    <span class="built_in">swap</span>(nums[lo], nums[randomIndex]);</span><br><span class="line"></span><br><span class="line">    <span class="type">int</span> pivot = nums[lo];</span><br><span class="line"></span><br><span class="line">    <span class="type">int</span> lt = lo;                <span class="comment">/* lt表示严格小于pivot元素区间的后一个位置 */</span></span><br><span class="line">    <span class="type">int</span> gt = hi;                <span class="comment">/* gt表示严格大于pivot元素区间的前一个位置 */</span></span><br><span class="line">    <span class="type">int</span> i = lo + <span class="number">1</span>;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">while</span> (i &lt;= gt) &#123;</span><br><span class="line">        <span class="keyword">if</span> (nums[i] &lt; pivot) &#123;</span><br><span class="line">            <span class="built_in">swap</span>(nums[lt++], nums[i++]);</span><br><span class="line">        &#125; <span class="keyword">else</span> <span class="keyword">if</span> (nums[i] &gt; pivot) &#123;</span><br><span class="line">            <span class="built_in">swap</span>(nums[i], nums[gt--]);</span><br><span class="line">        &#125; <span class="keyword">else</span> &#123;</span><br><span class="line">            i++;</span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="built_in">quickSort</span>(nums, lo, lt - <span class="number">1</span>);</span><br><span class="line">    <span class="built_in">quickSort</span>(nums, gt + <span class="number">1</span>, hi);</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure></li><li><p>Approach 2: 先处理其它元素，最后交换<code>pivot</code></p>  <figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">quickSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> hi)</span> </span>&#123;</span><br><span class="line">    <span class="keyword">if</span> (lo &gt;= hi) <span class="keyword">return</span>;</span><br><span class="line"></span><br><span class="line">    <span class="built_in">srand</span>((<span class="type">unsigned</span>) <span class="built_in">time</span>(<span class="literal">NULL</span>));</span><br><span class="line">    <span class="type">int</span> randomIndex = lo + <span class="built_in">rand</span>() % (hi - lo + <span class="number">1</span>);</span><br><span class="line">    <span class="built_in">swap</span>(nums[lo], nums[randomIndex]);</span><br><span class="line"></span><br><span class="line">    <span class="type">int</span> pivot = nums[lo];</span><br><span class="line"></span><br><span class="line">    <span class="type">int</span> lt = lo + <span class="number">1</span>;</span><br><span class="line">    <span class="type">int</span> gt = hi;</span><br><span class="line">    <span class="type">int</span> i = lo + <span class="number">1</span>;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">while</span> (i &lt;= gt) &#123;</span><br><span class="line">        <span class="keyword">if</span> (nums[i] &lt; pivot) &#123;</span><br><span class="line">            <span class="built_in">swap</span>(nums[lt++], nums[i++]);</span><br><span class="line">        &#125; <span class="keyword">else</span> <span class="keyword">if</span> (nums[i] == pivot) &#123;</span><br><span class="line">            i++;</span><br><span class="line">        &#125; <span class="keyword">else</span> &#123;</span><br><span class="line">            <span class="built_in">swap</span>(nums[i], nums[gt--]);</span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="built_in">swap</span>(nums[lo], nums[lt - <span class="number">1</span>]);</span><br><span class="line">    <span class="built_in">quickSort</span>(nums, lo, lt - <span class="number">2</span>);</span><br><span class="line">    <span class="built_in">quickSort</span>(nums, gt + <span class="number">1</span>, hi);</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure></li></ul><blockquote><p>三路快排针对存在大量重复的<code>pivot</code>元素</p></blockquote><p>复杂度分析：</p><ul><li><p>时间复杂度：$O(nlogn)$</p></li><li><p>空间复杂度：$O(nlogn)$</p></li></ul><p>稳定性: 算法不稳定，最快的排序算法。</p><h4 id="归并排序"><a href="#归并排序" class="headerlink" title="归并排序"></a>归并排序</h4><p>基本思想：分而治之，按照「深度优先遍历」的顺序「拆分子问题」与「组合子问题的解」</p><ul><li><p>Approach 1: 合并的时候处理辅助数组，后处理待排序数组</p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">mergeSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> hi, vector&lt;<span class="type">int</span>&gt;&amp; aux)</span> </span>&#123;</span><br><span class="line">    <span class="keyword">if</span> (lo &gt;= hi) <span class="keyword">return</span>;</span><br><span class="line"></span><br><span class="line">    <span class="type">int</span> mid = lo + (hi - lo) / <span class="number">2</span>;</span><br><span class="line">    <span class="built_in">mergeSort</span>(nums, lo, mid, aux);</span><br><span class="line">    <span class="built_in">mergeSort</span>(nums, mid + <span class="number">1</span>, hi, aux);</span><br><span class="line">    <span class="built_in">merge</span>(nums, lo, mid, hi, aux);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">merge</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> mid, <span class="type">int</span> hi, vector&lt;<span class="type">int</span>&gt;&amp; aux)</span> </span>&#123;</span><br><span class="line">    <span class="type">int</span> i = lo;</span><br><span class="line">    <span class="type">int</span> j = mid + <span class="number">1</span>;</span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> k = lo; k &lt;= hi; k++) &#123;</span><br><span class="line">        <span class="keyword">if</span> (i &lt;= mid &amp;&amp; (j &gt; hi || nums[i] &lt;= nums[j])) &#123;</span><br><span class="line">            aux[k] = nums[i++];</span><br><span class="line">        &#125; <span class="keyword">else</span> &#123;</span><br><span class="line">            aux[k] = nums[j++];</span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> k = lo; k &lt;= hi; k++) &#123;</span><br><span class="line">        nums[k] = aux[k];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure></li><li><p>Approach 2: 先处理辅助数组，合并的时候处理待排序数组</p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">mergeSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> hi, vector&lt;<span class="type">int</span>&gt;&amp; aux)</span> </span>&#123;</span><br><span class="line">    <span class="keyword">if</span> (lo &gt;= hi) <span class="keyword">return</span>;</span><br><span class="line"></span><br><span class="line">    <span class="type">int</span> mid = lo + (hi - lo) / <span class="number">2</span>;</span><br><span class="line">    <span class="built_in">mergeSort</span>(nums, lo, mid, aux);</span><br><span class="line">    <span class="built_in">mergeSort</span>(nums, mid + <span class="number">1</span>, hi, aux);</span><br><span class="line">    <span class="built_in">merge</span>(nums, lo, mid, hi, aux);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">merge</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> mid, <span class="type">int</span> hi, vector&lt;<span class="type">int</span>&gt;&amp; aux)</span> </span>&#123;</span><br><span class="line">    <span class="type">int</span> i = lo;</span><br><span class="line">    <span class="type">int</span> j = mid + <span class="number">1</span>;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> k = lo; k &lt;= hi; k++) aux[k] = nums[k];</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> k = lo; k &lt;= hi; k++) &#123;</span><br><span class="line">        <span class="keyword">if</span> (i &gt; mid)                   nums[k] = aux[j++];</span><br><span class="line">        <span class="keyword">else</span> <span class="keyword">if</span> (j &gt; hi)               nums[k] = aux[i++];</span><br><span class="line">        <span class="keyword">else</span> <span class="keyword">if</span> (aux[j] &lt; aux[i])      nums[k] = aux[j++];</span><br><span class="line">        <span class="keyword">else</span>                           nums[k] = aux[i++];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure></li></ul><p>优化思路：</p><ul><li><p>在小区间使用插入排序</p></li><li><p>合并之前判断数组是否已经有序</p></li></ul><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">mergeSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> hi, vector&lt;<span class="type">int</span>&gt;&amp; aux)</span> </span>&#123;</span><br><span class="line">    <span class="keyword">if</span> (hi - lo &lt; <span class="number">16</span>) &#123;                            <span class="comment">/* optimization 1 */</span></span><br><span class="line">        <span class="built_in">insertionSort</span>(nums, lo, hi);</span><br><span class="line">        <span class="keyword">return</span>;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="type">int</span> mid = lo + (hi - lo) / <span class="number">2</span>;</span><br><span class="line">    <span class="built_in">mergeSort</span>(nums, lo, mid, aux);</span><br><span class="line">    <span class="built_in">mergeSort</span>(nums, mid + <span class="number">1</span>, hi, aux);</span><br><span class="line"></span><br><span class="line">    <span class="keyword">if</span> (nums[mid] &lt;= nums[mid + <span class="number">1</span>]) <span class="keyword">return</span>;       <span class="comment">/* optimization 2 */</span></span><br><span class="line"></span><br><span class="line">    <span class="built_in">merge</span>(nums, lo, mid, hi, aux);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">merge</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> mid, <span class="type">int</span> hi, vector&lt;<span class="type">int</span>&gt;&amp; aux)</span> </span>&#123;</span><br><span class="line">    <span class="type">int</span> i = lo;</span><br><span class="line">    <span class="type">int</span> j = mid + <span class="number">1</span>;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> k = lo; k &lt;= hi; k++) aux[k] = nums[k];</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> k = lo; k &lt;= hi; k++) &#123;</span><br><span class="line">        <span class="keyword">if</span> (i &gt; mid)                   nums[k] = aux[j++];</span><br><span class="line">        <span class="keyword">else</span> <span class="keyword">if</span> (j &gt; hi)               nums[k] = aux[i++];</span><br><span class="line">        <span class="keyword">else</span> <span class="keyword">if</span> (aux[j] &lt; aux[i])      nums[k] = aux[j++];</span><br><span class="line">        <span class="keyword">else</span>                           nums[k] = aux[i++];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">insertionSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> lo, <span class="type">int</span> hi)</span> </span>&#123;</span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = lo + <span class="number">1</span>; i &lt;= hi; i++) &#123;</span><br><span class="line">        <span class="type">int</span> key = nums[i];</span><br><span class="line">        <span class="type">int</span> j;</span><br><span class="line">        <span class="keyword">for</span> (j = i; j &gt; lo &amp;&amp; nums[j - <span class="number">1</span>] &gt; key; j--) &#123;</span><br><span class="line">            nums[j] = nums[j - <span class="number">1</span>];</span><br><span class="line">        &#125;</span><br><span class="line">        nums[j] = key;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><p>复杂度分析：</p><ul><li><p>时间复杂度：$O(nlogn)$</p></li><li><p>空间复杂度：$O(n)$</p></li></ul><p>稳定性: 算法稳定。</p><h4 id="堆排序"><a href="#堆排序" class="headerlink" title="堆排序"></a>堆排序</h4><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">heapSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums)</span> </span>&#123;</span><br><span class="line">    <span class="type">int</span> N = nums.<span class="built_in">size</span>() - <span class="number">1</span>;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = (N - <span class="number">1</span>) / <span class="number">2</span>; i &gt;= <span class="number">0</span>; i--) &#123;</span><br><span class="line">        <span class="built_in">sink</span>(nums, i, N);</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">while</span> (N &gt; <span class="number">0</span>) &#123;</span><br><span class="line">        <span class="built_in">swap</span>(nums[<span class="number">0</span>], nums[N--]);</span><br><span class="line">        <span class="built_in">sink</span>(nums, <span class="number">0</span>, N);</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">sink</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> k, <span class="type">int</span> N)</span> </span>&#123;</span><br><span class="line">    <span class="keyword">while</span> (k * <span class="number">2</span> + <span class="number">1</span> &lt;= N) &#123;</span><br><span class="line">        <span class="type">int</span> i = k * <span class="number">2</span> + <span class="number">1</span>;</span><br><span class="line">        <span class="keyword">if</span> (i &lt; N &amp;&amp; nums[i] &lt; nums[i + <span class="number">1</span>]) &#123;</span><br><span class="line">            i++;</span><br><span class="line">        &#125;</span><br><span class="line">        <span class="keyword">if</span> (nums[k] &gt;= nums[i]) <span class="keyword">break</span>;</span><br><span class="line">        <span class="built_in">swap</span>(nums[k], nums[i]);</span><br><span class="line">        k = i;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><p>注意：</p><p>二叉树（堆）中，如果有效元素从下标0开始算起，位置为k的节点的父节点位置为$\lfloor (k - 1) &#x2F; 2 \lfloor$，而它的两个子节点的位置分别为$2k + 1$和$2k + 2$。</p><p>如果有效元素从下标0开始算起，二叉树（堆）中最后一个非孩子节点元素下标为$\lfloor(length - 1) &#x2F; 2\rfloor$</p><p>二叉树（堆）中，如果有效元素从下标1开始算起，位置为k的节点的父节点位置为$\lfloor k &#x2F; 2 \lfloor$，而它的两个子节点的位置分别为$2k$和$2k + 1$。</p><p>复杂度分析：</p><ul><li><p>时间复杂度：$O(nlogn)$</p></li><li><p>空间复杂度：$O(1)$</p></li></ul><p>稳定性: 算法不稳定。</p><h2 id="非比较的排序算法"><a href="#非比较的排序算法" class="headerlink" title="非比较的排序算法"></a>非比较的排序算法</h2><h3 id="计数排序"><a href="#计数排序" class="headerlink" title="计数排序"></a>计数排序</h3><p>feature: 数组中的元素都是正整数</p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="type">void</span> <span class="title">countingSort</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums)</span> </span>&#123;</span><br><span class="line">    <span class="type">int</span> k = *<span class="built_in">max_element</span>(nums.<span class="built_in">begin</span>(), nums.<span class="built_in">end</span>());</span><br><span class="line">    <span class="type">int</span> n = nums.<span class="built_in">size</span>();</span><br><span class="line"></span><br><span class="line">    <span class="function">vector&lt;<span class="type">int</span>&gt; <span class="title">count</span><span class="params">(k + <span class="number">1</span>, <span class="number">0</span>)</span></span>;</span><br><span class="line">    <span class="function">vector&lt;<span class="type">int</span>&gt; <span class="title">output</span><span class="params">(nums.size(), <span class="number">0</span>)</span></span>;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = <span class="number">0</span>; i &lt; n; i++)                     <span class="comment">/* step1: 计数 */</span></span><br><span class="line">        count[nums[i]]++;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = <span class="number">1</span>; i &lt; k + <span class="number">1</span>; i++)                <span class="comment">/* step2: 统计小于等于nums[i]的元素个数 */</span></span><br><span class="line">        count[i] += count[i - <span class="number">1</span>];</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = nums.<span class="built_in">size</span>() - <span class="number">1</span>; i &gt;= <span class="number">0</span>; i--)     <span class="comment">/* step3: 将每个元素放到正确位置 */</span></span><br><span class="line">        output[--count[nums[i]]] = nums[i];</span><br><span class="line"></span><br><span class="line">    nums.<span class="built_in">assign</span>(output.<span class="built_in">begin</span>(), output.<span class="built_in">end</span>());</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><p>Q&amp;A:</p><ul><li><p>count[nums[i]]表示小于等于nums[i]的元素个数，所以将nums[i]放到count[nums[i]] - 1的位置</p></li><li><p>nums[i]中可能存在多个相等的元素，所以取出nums[i]后需要将count[nums[i]]减1，使后面的元素能放到正确的位置上面</p></li><li><p>for循环从后往前遍历，是为了是值相等的元素也是从后往前放到最终的数组中，从而保证算法的稳定性</p></li></ul><p>复杂度分析：</p><ul><li><p>时间复杂度：$O(n + k)$</p></li><li><p>空间复杂度：$O(k)$，其中k表示元素的取值范围</p></li></ul><p>稳定性: 算法稳定。</p><h3 id="基数排序"><a href="#基数排序" class="headerlink" title="基数排序"></a>基数排序</h3><h3 id="桶排序"><a href="#桶排序" class="headerlink" title="桶排序"></a>桶排序</h3><hr><p>References:</p><p>[1] 《Algirithms, 4th Edition》第二章：排序</p><p>[2] <a href="https://space.bilibili.com/236935093/channel/collectiondetail?sid=378477">《算法不好玩》专题六：快速排序</a></p>]]>
    </content>
    <id>http://blog.unazoomer.xyz/posts/ec44b182/</id>
    <link href="http://blog.unazoomer.xyz/posts/ec44b182/"/>
    <published>2023-01-01T05:23:24.000Z</published>
    <summary>
      <![CDATA[<p>下面的这些排序算法可以在<a href="https://leetcode.com/problems/sort-an-array/">leetcode 912. Sort an Array</a>练习</p>]]>
    </summary>
    <title>常见排序算法</title>
    <updated>2026-11-16T09:37:09.743Z</updated>
  </entry>
</feed>
