冒泡法排序c语言程序

In this article you will get program for in C++.

在本文中，您将获得C ++中的程序。

Bubble sort is a sorting technique in which each pair of adjacent elements are compared, if they are in wrong order we swap them. This algorithm is named as bubble sort because, same as like bubbles the smaller or lighter elements comes up (at start) and bigger or heavier elements goes down (at end). Below I have shared a program for bubble sort in C++ which sorts a list of numbers in ascending order.

冒泡排序是一种对每对相邻元素进行比较的排序技术，如果它们的顺序错误，我们将其交换。 该算法之所以称为气泡排序，是因为与气泡类似，较小或较轻的元素会出现(在开始时)，较大或较重的元素会下降(在结束时)。 下面，我共享了一个C ++中的冒泡排序程序，该程序以升序对数字列表进行排序。

Also Read:  

另请阅读：

C ++中的冒泡排序程序 (Program for Bubble Sort in C++)

#include
     
       using namespace std; int main(){	int a[50],n,i,j,temp;	cout<<"Enter the size of array: ";	cin>>n;	cout<<"Enter the array elements: "; 		for(i=0;i
      
       >a[i];			for(i=1;i
       
        a[j+1])			{				temp=a[j];				a[j]=a[j+1];				a[j+1]=temp;			}	}		cout<<"Array after bubble sort:";	for(i=0;i
       
      
     

Output

输出量

翻译自:

冒泡法排序c语言程序