升序算法
        arr.sort((a,b)=>{
            return a-b;
        })
        降序算法
        arr.sort((a,b)=>{
            return b-a;
        })
<!DOCTYPE html><html lang="en"><head><meta charset="UTF-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><title>Document</title></head><body><script>var arr = [4,7,1,3,14]// sort/*升序算法arr.sort((a,b)=>{return a-b;})降序算法arr.sort((a,b)=>{return b-a;})*/var res = arr.sort((a,b)=>{return a-b;})console.log(res)</script></body></html>

