冒泡排序

const arr = [45,4,6,7,8,12,3,45,5,6,7,78,234,12,3,1];
let temp = 0;

for(let i = 0; i < arr.length; i++){
	for(let j = i; j < arr.length; j++){
		if(arr[i] > arr[j]){
           		temp = arr[i];
			arr[i] = arr[j];
            		arr[j] = temp;
		} 
   	 }
}

const arr = [45,4,6,7,8,12,3,45,5,6,7,78,234,12,3,1];

for(let i = 0; i < arr.length; i++){
	for(let j = i; j < arr.length; j++){
		if(arr[i] > arr[j]){
          	   arr[i] = arr[j] + arr[i];
		   arr[j] = arr[i] - arr[j];
           	   arr[i] = arr[i] - arr[j];
		} 
   	 }
}