Bubble sort code implementation

Bubble sort

#include <iostream>
using namespace std;

typedef int ElemType;
struct SSTable
{
    
	ElemType* elelm;// The starting address of the storage element 
	int TableLen;// Element number 
};
void ST_Init(SSTable& ST, int len) {
    
	ST.TableLen = len;
	ST.elelm = (ElemType*)malloc(sizeof(ElemType) * ST.TableLen);
	int i;
	srand(time(NULL));// Random number generation , Every time you execute the code, you get random numbers 
	for (i = 0; i < ST.TableLen; i++) {
    
		ST.elelm[i] = rand() % 100;
	}
}
// Exchange function 
void swap(ElemType& a, ElemType& b) {
    
	ElemType c = a;
	a = b;
	b = c;
}
// Bubble sort 
void BubbleSort(ElemType A[], int n) {
    
	for (int i = 0; i < n - 1; i++) {
    
		for (int j = n - 1; j > i; j--) {
    
			if (A[j - 1] > A[j]) {
    
				swap(A[j - 1], A[j]);
			}
		}
	}
}
int main()
{
    
	ElemType A[] = {
     10,2,6,5,3,9,8,4,7,1 };
	int len = 10;
	BubbleSort(A, len);
}

add to flag Variable to control the loop , When the sequence of subsequent numbers is already orderly , There is no need to make redundant cycles to compare . So in the first layer of the loop, add a bool Variable flag == false To judge , If there is an exchange in the second layer of the loop , will flag == true. Judge after exiting the second cycle flag, If it is true The cycle continues , If it is false, Explain that the following numbers are not exchanged , It means that everything is in order , Don't cycle , Just exit the first layer of circulation .

// Bubble sort 
void BubbleSort(ElemType A[], int n) {
    
	bool flag;
	for (int i = 0; i < n - 1; i++) {
    //i Is to control how many orders there are 
		flag = false;
		for (int j = n - 1; j > i; j--) {
    // Internal control comparison and Exchange 
			if (A[j - 1] > A[j]) {
    
				swap(A[j - 1], A[j]);
				flag = true;
			}
		}
		if (false == flag)
		{
    
			break;
		}
	}
}

Click download source