前端算法

``` let nums = [1, 2, 5] function huisuo(nums) { let len = nums.length; let res = []; function backT

``` const allMoney = [100, 50, 20, 10, 5, 1]; function changeMoney(n, allMoney) { //数组长度 const lengt

``` function xier(arr) { let len = arr.length;//数组长度 let willinsertValue; let gap = len;//增量 //trunc

``` function charu(arr) { for (let i = 1; i < arr.length; i++) { let key = arr[i]; //从中随便选取一个; let j

``` function xuanze() { for (let i = 0; i < arr.length - 1; i++) { //最小坐标值 let min = i; for (let j =

``` var arr = [10, 8, 6, 1, 4, 5, 2, 7]; function quick(arr, left, right) { //快速排序设定基准值 let pivot =