C语言Matrix编程题——[Arrays]D. Liang 6.16 Bubble sort

最新推荐文章于 2023-04-12 22:21:32 发布

Kamenrider Justice

最新推荐文章于 2023-04-12 22:21:32 发布

阅读量273

点赞数

分类专栏： C语言Matrix 文章标签： c语言

本文链接：https://blog.csdn.net/weixin_45534040/article/details/105740765

版权

C语言Matrix 专栏收录该内容

46 篇文章 3 订阅

订阅专栏

[Arrays]D. Liang 6.16 Bubble sort

Description：

Write a sort function that uses the bubble-sort algorithm.
The bubble-sort algorithm makes several passes through the array. On each pass, successive neighboring pairs are compared. If a pair is in decreasing order, its values are swapped; otherwise, the values remain unchanged. The technique is called a bubble sort or sinking sort because the smaller values gradually “bubble” their way to the top and the larger values sink to the bottom.

void bubbleSort(double list[], int size)

Hint：

You should submit the implementation of the function but do not submit the main() function.

Programme：

//Date：2020/4/24
//Author：Kamenrider Justice
void bubbleSort(double list[], int size)
{
   int i,j;
   double temp;
   int min_index;
   for(i=0;i<size;i++)
   {
      min_index=i;
      for(j=i+1;j<size;j++)//从第i+1个数到最后一个数中，找到最小值的下标，保存在min_index中
      {
         if(list[min_index]>list[j])
         {
            min_index=j;
         }
      }
      if(min_index!=i)//交换最小值和list[i]，从而让最小值留在第i个数，实现排序功能
      {
         temp=list[min_index];
         list[min_index]=list[i];
         list[i]=temp;
      }
   }
}