冒泡排序和选择排序

<script type="text/javascript">
			
			//冒泡排序
			var arr1 = [11,2,9,5,3];
			function bubbleSort(arr){
				for(var i = 0; i < arr.length-1; i++){
					for(var j = 0; j <arr.length-1-i; j++){
						if(arr[j]<arr[j+1]){
							var temp = arr[j];
							arr[j] = arr[j+1];
							arr[j+1] = temp;
						}
					}
				}
				return arr
			}
			console.log(bubbleSort(arr1));   //2,3,5,9,11
			
			
			//选择排序
			arr = [1,5,9,7,3,15,11]
			for(var i = 0; i < arr.length-1 ; i++){
				var minIndex = i;
				for(var j = i+1; j < arr.length; j++){
					if(arr[minIndex]>arr[j]){
						minIndex = j;
					}
					var temp = arr[i];
					arr[i] = arr[minIndex]
					arr[minIndex] =temp;
				}
			}
			console.log(arr);
		</script>