Skip to content

Commit

Permalink
Site updated: 2020-10-07 19:09:08
Browse files Browse the repository at this point in the history
  • Loading branch information
@Mr-whoz
Mr-whoz committed Oct 7, 2020
1 parent a20f834 commit e71d6e5
Show file tree
Hide file tree
Showing 25 changed files with 3,211 additions and 122 deletions.
10 changes: 5 additions & 5 deletions 2020/09/16/hello-world/index.html
View file
Original file line number Diff line number Diff line change
Expand Up @@ -417,20 +417,20 @@ <h3 id="Deploy-to-remote-sites"><a href="#Deploy-to-remote-sites" class="headerl
<div class="site-state-item site-state-posts">
<a href="/archives/">

<span class="site-state-item-count">3</span>
<span class="site-state-item-count">5</span>
<span class="site-state-item-name">日志</span>
</a>
</div>
<div class="site-state-item site-state-categories">
<a href="/categories/">

<span class="site-state-item-count">5</span>
<span class="site-state-item-count">7</span>
<span class="site-state-item-name">分类</span></a>
</div>
<div class="site-state-item site-state-tags">
<a href="/tags/">

<span class="site-state-item-count">4</span>
<span class="site-state-item-count">5</span>
<span class="site-state-item-name">标签</span></a>
</div>
</nav>
Expand Down Expand Up @@ -479,13 +479,13 @@ <h3 id="Deploy-to-remote-sites"><a href="#Deploy-to-remote-sites" class="headerl
<i class="fa fa-chart-area"></i>
</span>
<span class="post-meta-item-text">站点总字数：</span>
<span title="站点总字数">4k</span>
<span title="站点总字数">5k</span>
<span class="post-meta-divider">|</span>
<span class="post-meta-item-icon">
<i class="fa fa-coffee"></i>
</span>
<span class="post-meta-item-text">站点阅读时长 &asymp;</span>
<span title="站点阅读时长">3 分钟</span>
<span title="站点阅读时长">5 分钟</span>
</div>


Expand Down
10 changes: 5 additions & 5 deletions 2020/09/24/数据管理/index.html
View file
Original file line number Diff line number Diff line change
Expand Up @@ -418,20 +418,20 @@ <h6 id="●-数据是有价值的"><a href="#●-数据是有价值的" class="h
<div class="site-state-item site-state-posts">
<a href="/archives/">

<span class="site-state-item-count">3</span>
<span class="site-state-item-count">5</span>
<span class="site-state-item-name">日志</span>
</a>
</div>
<div class="site-state-item site-state-categories">
<a href="/categories/">

<span class="site-state-item-count">5</span>
<span class="site-state-item-count">7</span>
<span class="site-state-item-name">分类</span></a>
</div>
<div class="site-state-item site-state-tags">
<a href="/tags/">

<span class="site-state-item-count">4</span>
<span class="site-state-item-count">5</span>
<span class="site-state-item-name">标签</span></a>
</div>
</nav>
Expand Down Expand Up @@ -480,13 +480,13 @@ <h6 id="●-数据是有价值的"><a href="#●-数据是有价值的" class="h
<i class="fa fa-chart-area"></i>
</span>
<span class="post-meta-item-text">站点总字数：</span>
<span title="站点总字数">4k</span>
<span title="站点总字数">5k</span>
<span class="post-meta-divider">|</span>
<span class="post-meta-item-icon">
<i class="fa fa-coffee"></i>
</span>
<span class="post-meta-item-text">站点阅读时长 &asymp;</span>
<span title="站点阅读时长">3 分钟</span>
<span title="站点阅读时长">5 分钟</span>
</div>


Expand Down
44 changes: 30 additions & 14 deletions 2020/10/04/堆排序/index.html
View file
Original file line number Diff line number Diff line change
Expand Up @@ -22,15 +22,15 @@
var CONFIG = {"hostname":"example.com","root":"/","scheme":"Gemini","version":"7.8.0","exturl":false,"sidebar":{"position":"right","display":"always","padding":18,"offset":12,"onmobile":false},"copycode":{"enable":true,"show_result":false,"style":null},"back2top":{"enable":true,"sidebar":true,"scrollpercent":true},"bookmark":{"enable":false,"color":"#222","save":"auto"},"fancybox":false,"mediumzoom":false,"lazyload":false,"pangu":false,"comments":{"style":"tabs","active":null,"storage":true,"lazyload":false,"nav":null},"algolia":{"hits":{"per_page":10},"labels":{"input_placeholder":"Search for Posts","hits_empty":"We didn't find any results for the search: ${query}","hits_stats":"${hits} results found in ${time} ms"}},"localsearch":{"enable":false,"trigger":"auto","top_n_per_article":-1,"unescape":false,"preload":false},"motion":{"enable":true,"async":false,"transition":{"post_block":"fadeIn","post_header":"slideDownIn","post_body":"slideDownIn","coll_header":"slideLeftIn","sidebar":"slideUpIn"}}};
</script>

<meta name="description" content="堆排序是十个排序算法之一 1int a&#x3D;0;">
<meta name="description" content="堆的性质堆从0开始标号 索引为i的左孩子的索引是 (2*i+1); 索引为i的左孩子的索引是 (2*i+2); 索引为i的父结点的索引是 floor((i-1)&#x2F;2); 堆是完全二叉树 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849#include&lt;io">
<meta property="og:type" content="article">
<meta property="og:title" content="堆排序">
<meta property="og:url" content="http://example.com/2020/10/04/%E5%A0%86%E6%8E%92%E5%BA%8F/index.html">
<meta property="og:site_name" content="我的笔记本">
<meta property="og:description" content="堆排序是十个排序算法之一 1int a&#x3D;0;">
<meta property="og:description" content="堆的性质堆从0开始标号 索引为i的左孩子的索引是 (2*i+1); 索引为i的左孩子的索引是 (2*i+2); 索引为i的父结点的索引是 floor((i-1)&#x2F;2); 堆是完全二叉树 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849#include&lt;io">
<meta property="og:locale" content="zh_CN">
<meta property="article:published_time" content="2020-10-04T11:22:48.000Z">
<meta property="article:modified_time" content="2020-10-04T11:29:59.649Z">
<meta property="article:modified_time" content="2020-10-05T03:07:37.265Z">
<meta property="article:author" content="note">
<meta property="article:tag" content="算法">
<meta property="article:tag" content="排序算法">
Expand Down Expand Up @@ -203,10 +203,16 @@ <h1 class="post-title" itemprop="name headline">
<i class="far fa-calendar"></i>
</span>
<span class="post-meta-item-text">发表于</span>


<time title="创建时间：2020-10-04 19:22:48 / 修改时间：19:29:59" itemprop="dateCreated datePublished" datetime="2020-10-04T19:22:48+08:00">2020-10-04</time>
<time title="创建时间：2020-10-04 19:22:48" itemprop="dateCreated datePublished" datetime="2020-10-04T19:22:48+08:00">2020-10-04</time>
</span>
<span class="post-meta-item">
<span class="post-meta-item-icon">
<i class="far fa-calendar-check"></i>
</span>
<span class="post-meta-item-text">更新于</span>
<time title="修改时间：2020-10-05 11:07:37" itemprop="dateModified" datetime="2020-10-05T11:07:37+08:00">2020-10-05</time>
</span>
<span class="post-meta-item">
<span class="post-meta-item-icon">
<i class="far fa-folder"></i>
Expand Down Expand Up @@ -252,7 +258,7 @@ <h1 class="post-title" itemprop="name headline">
<i class="far fa-file-word"></i>
</span>
<span class="post-meta-item-text">本文字数：</span>
<span>20</span>
<span>1.1k</span>
</span>
<span class="post-meta-item" title="阅读时长">
<span class="post-meta-item-icon">
Expand All @@ -271,8 +277,14 @@ <h1 class="post-title" itemprop="name headline">
<div class="post-body" itemprop="articleBody">


<p>堆排序是十个排序算法之一</p>
<figure class="highlight c++"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">int</span> a=<span class="number">0</span>;</span><br></pre></td></tr></table></figure>
<h1 id="堆的性质"><a href="#堆的性质" class="headerlink" title="堆的性质"></a>堆的性质</h1><p>堆从0开始标号</p>
<ul>
<li>索引为i的左孩子的索引是 (2*i+1);</li>
<li>索引为i的左孩子的索引是 (2*i+2);</li>
<li>索引为i的父结点的索引是 floor((i-1)/2); </li>
</ul>
<p>堆是<strong>完全二叉树</strong></p>
<figure class="highlight c++"><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><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span><span class="meta-string">&lt;iostream&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="meta-keyword">include</span><span class="meta-string">&lt;vector&gt;</span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"> </span><br><span class="line"><span class="comment">// 递归方式构建大根堆(len是arr的长度，index是第一个非叶子节点的下标)</span></span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">adjust</span><span class="params">(<span class="built_in">vector</span>&lt;<span class="keyword">int</span>&gt; &amp;arr, <span class="keyword">int</span> len, <span class="keyword">int</span> index)</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line"> <span class="keyword">int</span> left = <span class="number">2</span>*index + <span class="number">1</span>; <span class="comment">// index的左子节点</span></span><br><span class="line"> <span class="keyword">int</span> right = <span class="number">2</span>*index + <span class="number">2</span>;<span class="comment">// index的右子节点</span></span><br><span class="line"> </span><br><span class="line"> <span class="keyword">int</span> maxIdx = index;</span><br><span class="line"> <span class="keyword">if</span>(left&lt;len &amp;&amp; arr[left] &gt; arr[maxIdx]) maxIdx = left;</span><br><span class="line"> <span class="keyword">if</span>(right&lt;len &amp;&amp; arr[right] &gt; arr[maxIdx]) maxIdx = right;</span><br><span class="line"> </span><br><span class="line"> <span class="keyword">if</span>(maxIdx != index)</span><br><span class="line"> &#123;</span><br><span class="line"> swap(arr[maxIdx], arr[index]);</span><br><span class="line"> adjust(arr, len, maxIdx);</span><br><span class="line"> &#125;</span><br><span class="line"> </span><br><span class="line">&#125;</span><br><span class="line"> </span><br><span class="line"><span class="comment">// 堆排序</span></span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">heapSort</span><span class="params">(<span class="built_in">vector</span>&lt;<span class="keyword">int</span>&gt; &amp;arr, <span class="keyword">int</span> size)</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line"> <span class="comment">// 构建大根堆（从最后一个非叶子节点向上）</span></span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i=size/<span class="number">2</span> - <span class="number">1</span>; i &gt;= <span class="number">0</span>; i--)</span><br><span class="line"> &#123;</span><br><span class="line"> adjust(arr, size, i);</span><br><span class="line"> &#125;</span><br><span class="line"> </span><br><span class="line"> <span class="comment">// 调整大根堆</span></span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i = size - <span class="number">1</span>; i &gt;= <span class="number">1</span>; i--)</span><br><span class="line"> &#123;</span><br><span class="line"> swap(arr[<span class="number">0</span>], arr[i]); <span class="comment">// 将当前最大的放置到数组末尾</span></span><br><span class="line"> adjust(arr, i, <span class="number">0</span>); <span class="comment">// 将未完成排序的部分继续进行堆排序</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="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line"> <span class="built_in">vector</span>&lt;<span class="keyword">int</span>&gt; arr = &#123;<span class="number">8</span>, <span class="number">1</span>, <span class="number">14</span>, <span class="number">3</span>, <span class="number">21</span>, <span class="number">5</span>, <span class="number">7</span>, <span class="number">10</span>&#125;;</span><br><span class="line"> heapSort(arr, arr.size());</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i=<span class="number">0</span>;i&lt;arr.size();i++)</span><br><span class="line"> &#123;</span><br><span class="line"> <span class="built_in">cout</span>&lt;&lt;arr[i]&lt;&lt;<span class="built_in">endl</span>;</span><br><span class="line"> &#125;</span><br><span class="line"> <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
</div>


Expand Down Expand Up @@ -331,7 +343,10 @@ <h1 class="post-title" itemprop="name headline">
<a href="/2020/09/24/%E6%95%B0%E6%8D%AE%E7%AE%A1%E7%90%86/" rel="prev" title="数据管理">
<i class="fa fa-chevron-left"></i> 数据管理
</a></div>
<div class="post-nav-item"></div>
<div class="post-nav-item">
<a href="/2020/10/05/%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F/" rel="next" title="快速排序">
快速排序 <i class="fa fa-chevron-right"></i>
</a></div>
</div>
</footer>

Expand Down Expand Up @@ -397,6 +412,7 @@ <h1 class="post-title" itemprop="name headline">

<!--noindex-->
<div class="post-toc-wrap sidebar-panel">
<div class="post-toc motion-element"><ol class="nav"><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%A0%86%E7%9A%84%E6%80%A7%E8%B4%A8"><span class="nav-number">1.</span> <span class="nav-text">堆的性质</span></a></li></ol></div>
</div>
<!--/noindex-->

Expand All @@ -410,20 +426,20 @@ <h1 class="post-title" itemprop="name headline">
<div class="site-state-item site-state-posts">
<a href="/archives/">

<span class="site-state-item-count">3</span>
<span class="site-state-item-count">5</span>
<span class="site-state-item-name">日志</span>
</a>
</div>
<div class="site-state-item site-state-categories">
<a href="/categories/">

<span class="site-state-item-count">5</span>
<span class="site-state-item-count">7</span>
<span class="site-state-item-name">分类</span></a>
</div>
<div class="site-state-item site-state-tags">
<a href="/tags/">

<span class="site-state-item-count">4</span>
<span class="site-state-item-count">5</span>
<span class="site-state-item-name">标签</span></a>
</div>
</nav>
Expand Down Expand Up @@ -472,13 +488,13 @@ <h1 class="post-title" itemprop="name headline">
<i class="fa fa-chart-area"></i>
</span>
<span class="post-meta-item-text">站点总字数：</span>
<span title="站点总字数">4k</span>
<span title="站点总字数">5k</span>
<span class="post-meta-divider">|</span>
<span class="post-meta-item-icon">
<i class="fa fa-coffee"></i>
</span>
<span class="post-meta-item-text">站点阅读时长 &asymp;</span>
<span title="站点阅读时长">3 分钟</span>
<span title="站点阅读时长">5 分钟</span>
</div>


Expand Down

0 comments on commit e71d6e5

Please sign in to comment.