Array operation

push and pop are more efficient than shift and unshift

since shift and unshift need to re-index

push O(1)
pop O(1)
shift O(N)
unshift O(N)
concat O(N)
slice O(N)
splice O(N)
sort O(NlogN)
forEach/map/filter/reduce... O(N)

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!