Home >Backend Development >PHP Tutorial >Bubble sort-php, bubble-php_PHP tutorial

Bubble sort-php, bubble-php_PHP tutorial

WBOY
WBOYOriginal
2016-07-13 10:10:37855browse

Bubble sort-php, bubble-php

<span>PHP实现的代码先奉上:<br /><br />function</span> bubble_sort(<span>$array</span><span>) {
    </span><span>for</span> (<span>$i</span> = 0; <span>$i</span> < <span>count</span>(<span>$array</span>) - 1; <span>$i</span>++) {    <span>//</span><span>$i为已经排过序的元素个数</span>
        <span>for</span> (<span>$j</span> = 0; <span>$j</span> < <span>count</span>(<span>$array</span>) - 1 - <span>$i</span>; <span>$j</span>++) {    <span>//</span><span>$j为需要排序的元素个数,用总长减去$i</span>
            <span>if</span> (<span>$array</span>[<span>$j</span>] > <span>$array</span>[<span>$j</span> + 1]) {    <span>//</span><span>按升序排序</span>
                <span>$temp</span> = <span>$array</span>[<span>$j</span><span>];
                </span><span>$array</span>[<span>$j</span>] = <span>$array</span>[<span>$j</span> + 1<span>];
                </span><span>$array</span>[<span>$j</span> + 1] = <span>$temp</span><span>;
            }
        }
    }
    </span><span>return</span> <span>$array</span><span>;
}<br /><br />$a = array(5, 1, 4, 7);<br /><br />代码执行过程:<br /></span>
<span>i = 0;<br />  j = 0;<br />  if($arr[0] > $arr[1]) => 5 > 1 条件成立,交换位置,形成新的数组 =>  1 5 4 7  j++<br />  if($arr[1] > $arr[2]) => 5 > 4 条件成立,交换位置, 形成新的数组 =>  1 4 5 7  j++ <br />  if($arr[2] > $arr[3]) => 5 > 7 条件不成立 ,数组保持不变 , 1 4 5 7 j++ j=3 退出内层循环, i++</span>
<span>依次类推吧。 <br /><br /><br /></span>
<span><br /><br /><br /></span>

www.bkjia.comtruehttp: //www.bkjia.com/PHPjc/934724.htmlTechArticleBubble sort-php, bubble-php PHP implementation code is provided first: function bubble_sort( $array ) { for ( $i = 0; $i count ( $array ) - 1; $i ++) { // $i is the number of elements that have been sorted...
Statement:
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn