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.
Problem Source: 程序设计I Chapter6 Arrays
Source.h
void bubbleSort(double arr[], int n);
// Date:2020/4/24
// Author:xiezhg5
void bubbleSort(double arr[], int n)
{
int i,j;
double temp;
for(i=0;i<n;i++)
for(j=0;j<n-1;j++)
{
//冒泡排序是基本算法
if(arr[j]>arr[j+1])
{
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}