[Data structure template] Bubble sort

#include<bits/stdc++.h> 
using namespace std;

int a[100001];
void BubbleSort(int left,int right){
	if (left==right) return;
	
	for(int j=right;j>=1;j--)
		for(int i=left;i<j;i++)
			if(a[i]>a[i+1]) swap(a[i],a[i+1]);
}
int main(){
	int n;cin>>n;
	for(int i=0;i<n;i++)scanf("%d",&a[i]);
	
	BubbleSort(0,n-1);
	for(int i=0;i<n;i++)printf("%d ",a[i]);
	return 0;
}