递归

<!Doctype html>
<html>
	<head>
		<meta charset='utf-8'>
		<title>快排递归</title>
		
		<script>
			window.onload = function (){

				var arr =[3,5,78,5,12,65,79,12,23,25];
				alert(quickSort(arr));
				

			function quickSort(arr){
					if(arr.length <= 1){
						return arr;
					}
					let leftArr = [];
					let rightArr = [];
					let q = arr[0];
					for(let i =1,l=arr.length; i<l; i++){
						if(arr[i]>q){
							rightArr.push(arr[i]);
						}
						else{
							leftArr.push(arr[i]);
						}
					}
					return [].concat(quickSort(leftArr),[q],quickSort(rightArr));
				}
			}
		</script>
	</head>
	<body>
		
	</body>
</html>