golang算法_冒泡排序算法
发布时间：2021-12-08 编辑：jiaochengji.com
教程集为您提供golang算法，冒泡排序算法等资源，欢迎您收藏本站，我们将为您提供最新的golang算法，冒泡排序算法资源
<svg xmlns="http://www.w3.org/2000/svg" style="display: none;"><path stroke-linecap="round" d="M5,0 0,2.5 5,5z" id="raphael-marker-block" style="-webkit-tap-highlight-color: rgba(0, 0, 0, 0);"/></svg><h4>冒泡排序算法</h4>
1.分析问题:
将前n个数字分别进行比较,最大的移动到了最后；
下一次，将前n-1个数字分别进行比较,最大的移动到了倒数第二位；
依此类推。
2.设计算法:
<pre><code>1)第一次排序:索引0至len(数组)-1左右元素进行比较,最大的数排在最后 2)第二次排序:索引0至len(数组)-2左右元素进行比较,最大的2个数从小到大排在最后 ... 3)第n次排序: 索引0至len(数组)-n左右元素进行比较,最大的n个数从小到大排在最后 </code></pre>3.编写程序:
<pre><code class="lang-go hljs"><span class="token keyword">func</span> <span class="token function">main</span><span class="token punctuation">(</span><span class="token punctuation">)</span><span class="token punctuation">{</span> <span class="token keyword">var</span> arr<span class="token punctuation">[</span><span class="token number">4</span><span class="token punctuation">]</span> <span class="token builtin">int</span><span class="token operator">=</span><span class="token punctuation">{</span><span class="token number">1</span><span class="token punctuation">,</span><span class="token operator">-</span><span class="token number">2</span><span class="token punctuation">,</span><span class="token number">3</span><span class="token punctuation">,</span><span class="token operator">-</span><span class="token number">4</span><span class="token punctuation">}</span> <span class="token comment">//len(arr)=4</span> <span class="token comment">//外层循环控制比较完一轮，减去不需要比较的下标</span> <span class="token comment">//内层循环相邻的数比较交换</span> <span class="token keyword">for</span> n <span class="token operator">:=</span> <span class="token number">1</span><span class="token punctuation">;</span> n <span class="token operator"><</span> <span class="token function">len</span><span class="token punctuation">(</span>arr<span class="token punctuation">)</span><span class="token operator">-</span><span class="token number">1</span><span class="token punctuation">;</span> n<span class="token operator"> </span><span class="token punctuation">{</span> <span class="token keyword">for</span> j <span class="token operator">:=</span> <span class="token number">0</span><span class="token punctuation">;</span> j <span class="token operator"><</span><span class="token function">len</span><span class="token punctuation">(</span>arr<span class="token punctuation">)</span><span class="token operator">-</span>n<span class="token punctuation">;</span> j<span class="token operator"> </span><span class="token punctuation">{</span> <span class="token keyword">if</span> arr<span class="token punctuation">[</span>j<span class="token punctuation">]</span> <span class="token operator">></span> arr<span class="token punctuation">[</span>j<span class="token operator"> </span><span class="token number">1</span><span class="token punctuation">]</span><span class="token punctuation">{</span> arr<span class="token punctuation">[</span>j<span class="token punctuation">]</span><span class="token punctuation">,</span>arr<span class="token punctuation">[</span>j<span class="token operator"> </span><span class="token number">1</span><span class="token punctuation">]</span> <span class="token operator">=</span> arr<span class="token punctuation">[</span>j<span class="token operator"> </span><span class="token number">1</span><span class="token punctuation">]</span><span class="token punctuation">,</span>arr<span class="token punctuation">[</span>j<span class="token punctuation">]</span> <span class="token punctuation">}</span> <span class="token punctuation">}</span> <span class="token punctuation">}</span> <span class="token punctuation">}</span> </code></pre>4.调试程序
<pre><code> [-4 -2 1 3] </code></pre> 到此这篇关于“golang算法_冒泡排序算法”的文章就介绍到这了,更多文章或继续浏览下面的相关文章，希望大家以后多多支持JQ教程网！您可能感兴趣的文章：
php 实现冒泡排序的简单例子
php 冒泡排序的实现代码
php冒泡排序算法一例
php冒泡排序算法实现代码
php冒泡排序的小例子
php 数组排序方法分享(冒泡排序、选择排序)
php选择排序算法实现代码
php实现冒泡排序算法的代码
php冒泡排序与快速排序的例子
JavaScript冒泡排序算法
[关闭]