为面试做准备之冒泡排序

<div class="container"><div class="line number1 index0 alt2"><code class="cpp preprocessor">#include<stdio.h></code></div><div class="line number2 index1 alt1"><code class="cpp preprocessor">#defineSIZE8</code></div><div class="line number3 index2 alt2"> </div><div class="line number4 index3 alt1"><code class="cpp plain">voidbubble_sort(inta[],intn);</code></div><div class="line number5 index4 alt2"> </div><div class="line number6 index5 alt1"><code class="cpp plain">voidbubble_sort(inta[],intn)</code><code class="cpp comments">//n为数组a的元素个数</code></div><div class="line number7 index6 alt2"><code class="cpp plain">{</code></div><div class="line number8 index7 alt1"><code class="cpp spaces">    </code><code class="cpp plain">inti,j,temp;</code></div><div class="line number9 index8 alt2"><code class="cpp spaces">    </code><code class="cpp keyword bold">for</code><code class="cpp plain">(j=0;j<n-1;j++)</code></div><div class="line number10 index9 alt1"><code class="cpp spaces">        </code><code class="cpp keyword bold">for</code><code class="cpp plain">(i=0;i<n-1-j;i++)</code></div><div class="line number11 index10 alt2"><code class="cpp spaces">        </code><code class="cpp plain">{</code></div><div class="line number12 index11 alt1"><code class="cpp spaces">            </code><code class="cpp keyword bold">if</code><code class="cpp plain">(a[i]>a[i+1])</code><code class="cpp comments">//数组元素大小按升序排列</code></div><div class="line number13 index12 alt2"><code class="cpp spaces">            </code><code class="cpp plain">{</code></div><div class="line number14 index13 alt1"><code class="cpp spaces">                </code><code class="cpp plain">temp=a[i];</code></div><div class="line number15 index14 alt2"><code class="cpp spaces">                </code><code class="cpp plain">a[i]=a[i+1];</code></div><div class="line number16 index15 alt1"><code class="cpp spaces">                </code><code class="cpp plain">a[i+1]=temp;</code></div><div class="line number17 index16 alt2"><code class="cpp spaces">            </code><code class="cpp plain">}</code></div><div class="line number18 index17 alt1"><code class="cpp spaces">        </code><code class="cpp plain">}</code></div><div class="line number19 index18 alt2"><code class="cpp plain">}</code></div><div class="line number20 index19 alt1"><code class="cpp plain">intmain()</code></div><div class="line number21 index20 alt2"><code class="cpp plain">{</code></div><div class="line number22 index21 alt1"><code class="cpp spaces">    </code><code class="cpp plain">intnumber[SIZE]={95,45,15,78,84,51,24,12};</code></div><div class="line number23 index22 alt2"><code class="cpp spaces">    </code><code class="cpp plain">inti;</code></div><div class="line number24 index23 alt1"><code class="cpp spaces">    </code><code class="cpp plain">bubble_sort(number,SIZE);</code></div><div class="line number25 index24 alt2"><code class="cpp spaces">    </code><code class="cpp keyword bold">for</code><code class="cpp plain">(i=0;i<SIZE;i++)</code></div><div class="line number26 index25 alt1"><code class="cpp spaces">    </code><code class="cpp plain">{</code></div><div class="line number27 index26 alt2"><code class="cpp spaces">        </code><code class="cpp functions bold">printf</code><code class="cpp plain">(</code><code class="cpp string">"%d"</code><code class="cpp plain">,number[i]);</code></div><div class="line number28 index27 alt1"><code class="cpp spaces">    </code><code class="cpp plain">}</code></div><div class="line number29 index28 alt2"><code class="cpp spaces">    </code><code class="cpp functions bold">printf</code><code class="cpp plain">(</code><code class="cpp string">"\n"</code><code class="cpp plain">);</code></div><div class="line number30 index29 alt1"><code class="cpp plain">}</code></div></div>



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值