11-3模拟sort内部实现.html

<!DOCTYPE html>
<html>
	<head>
		<meta charset="UTF-8">
		<title>11-3模拟sort内部实现</title>
	</head>
	<body>
		<script type="text/javascript">
			function sort(array,fnCompare){
				//外层循坏，控制趟数
				for(var i = 0; i < array.length -1; i++){
					//假设排好序了
					var isSort = true;
					//内层循环 控制比较的次数
					
					for(var j = 0; j < array.length - 1;j++){
						
						if(fnCompare(array[j],array[j+1]) > 0){
							isSort = false;
						//交换位置
						var tmp = array[j];
						array[j] = array[j+1];
						array[j+1] = tmp;
						}
						
					}
					//判断是否排好了
					if(isSort){
						break;
						
					}
				}
			}
				
			
			var array = [5,12,82,128,456];
			sort(array,function(a,b){
				return b - a;
			})
			console.log(array);
		</script>
	</body>
</html>