找出数组中最小的k个数-JavaScript实现

输入n个整数，找出其中最小的K个数。例如输入4,5,1,6,2,7,3,8这8个数字，则最小的4个数字是1,2,3,4。

例子：
1.
输入：[4,5,1,6,2,7,3,8],4
输出：[1,2,3,4]

输入：[0,1,1,1,4,5,3,7,7,8,10,2,7,8,0,5,2,16,12,1,19,15,5,18,2,2,22,15,8,22,17,6,22,6,22,26,32,8,10,11,2,26,9,12,9,7,28,33,20,7,2,17,44,3,52,27,2,23,19,56,56,58,36,31,1,19,19,6,65,49,27,63,29,1,69,47,56,61,40,43,10,71,60,66,42,44,10,12,83,69,73,2,65,93,92,47,35,39,13,75]，75
输出：
[0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 10, 10, 10, 10, 11, 12, 12, 12, 13, 15, 15, 16, 17, 17, 18, 19, 19, 19, 19, 20, 22, 22, 22, 22, 23, 26, 26, 27, 27, 28, 29, 31, 32, 33, 35, 36, 39, 40, 42]

**思路：**先对输入数组从小到大排序，然后输出前k个数

function fun(input, k) {
	let arr = new Array()
	input.sort(function (a,b){
		return a-b//从小到大排序
	})
	for (let i=0; i < k; i++) {
		arr.push(input[i])
	}
	return arr
}
let input = [0,1,1,1,4,5,3,7,7,8,10,2,7,8,0,5,2,16,12,1,19,15,5,18,2,2,22,15,8,22,17,6,22,6,22,26,32,8,10,11,2,26,9,12,9,7,28,33,20,7,2,17,44,3,52,27,2,23,19,56,56,58,36,31,1,19,19,6,65,49,27,63,29,1,69,47,56,61,40,43,10,71,60,66,42,44,10,12,83,69,73,2,65,93,92,47,35,39,13,75]
// let input =  [4,5,1,6,2,7,3,8]
console.log(fun(input,75))