Insertion Sort,insertionsort
Jun 13, 2016 am 09:21 AM
sort
Insertion Sort,insertionsort
<span> 1</span> <?<span>php </span><span> 2</span> <span>function</span> swap(&<span>$a</span>, &<span>$b</span><span>){ </span><span> 3</span> <span>$c</span> = <span>$a</span><span>; </span><span> 4</span> <span>$a</span> = <span>$b</span><span>; </span><span> 5</span> <span>$b</span> = <span>$c</span><span>; </span><span> 6</span> <span>} </span><span> 7</span> <span> 8</span> <span>#</span><span> insertion sort</span> <span> 9</span> <span>#</span><span> ascend</span> <span>10</span> <span>function</span> sortInsertion(&<span>$a</span>){ <span>#</span><span> a is an array of numbers</span> <span>11</span> <span>12</span> <span>#</span><span> length of a</span> <span>13</span> <span>$m</span> = <span>count</span>(<span>$a</span><span>); </span><span>14</span> <span>15</span> <span>if</span>(<span>$m</span> < 2<span>){ </span><span>16</span> <span>return</span><span>; </span><span>17</span> <span> } </span><span>18</span> <span>19</span> <span>#</span><span> for m numbers, we have m-1 numbers to insert</span> <span>20</span> <span>for</span>(<span>$i</span>=1; <span>$i</span><=<span>$m</span>-1; <span>$i</span>++<span>){ </span><span>21</span> <span>for</span>(<span>$j</span>=<span>$i</span>; <span>$j</span>>0; <span>$j</span>--<span>){ </span><span>22</span> <span>if</span>(<span>$a</span>[<span>$j</span>] < <span>$a</span>[<span>$j</span>-1<span>]){ </span><span>23</span> swap(<span>$a</span>[<span>$j</span>], <span>$a</span>[<span>$j</span>-1<span>]); </span><span>24</span> <span> } </span><span>25</span> <span> } </span><span>26</span> <span> } </span><span>27</span> <span>28</span> <span>return</span><span>; </span><span>29</span> <span>} </span><span>30</span> <span>31</span> <span>$arr</span> = <span>range</span>(5, 0<span>); </span><span>32</span> sortInsertion(<span>$arr</span><span>); </span><span>33</span> <span>echo</span> <span>implode</span>(', ', <span>$arr</span><span>); </span><span>34</span> <span>35</span> <span>//</span><span> 0, 1, 2, 3, 4, 5</span> <span>36</span> ?>
登录后复制
本站声明
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系admin@php.cn

热门文章
仓库:如何复兴队友
3 周前
By 尊渡假赌尊渡假赌尊渡假赌
击败分裂小说需要多长时间?
3 周前
By DDD
R.E.P.O.能量晶体解释及其做什么(黄色晶体)
1 周前
By 尊渡假赌尊渡假赌尊渡假赌
Hello Kitty Island冒险:如何获得巨型种子
3 周前
By 尊渡假赌尊渡假赌尊渡假赌
公众号网页更新缓存难题:如何避免版本更新后旧缓存影响用户体验?
3 周前
By 王林

热门文章
仓库:如何复兴队友
3 周前
By 尊渡假赌尊渡假赌尊渡假赌
击败分裂小说需要多长时间?
3 周前
By DDD
R.E.P.O.能量晶体解释及其做什么(黄色晶体)
1 周前
By 尊渡假赌尊渡假赌尊渡假赌
Hello Kitty Island冒险:如何获得巨型种子
3 周前
By 尊渡假赌尊渡假赌尊渡假赌
公众号网页更新缓存难题:如何避免版本更新后旧缓存影响用户体验?
3 周前
By 王林

热门文章标签

记事本++7.3.1
好用且免费的代码编辑器

SublimeText3汉化版
中文版,非常好用

禅工作室 13.0.1
功能强大的PHP集成开发环境

Dreamweaver CS6
视觉化网页开发工具

SublimeText3 Mac版
神级代码编辑软件(SublimeText3)

列表排序:Python的sort、sorted和numpy.argsort方法详解
