You can use big-o-notation to determine the performance of reduce at scale just like with any other traditional looping function.
It's linear time O(n) if you just run through each element in the array one time which is the default behavior of reduce.
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
You can use big-o-notation to determine the performance of reduce at scale just like with any other traditional looping function.
It's linear time O(n) if you just run through each element in the array one time which is the default behavior of reduce.