DEV Community

Discussion on: Brief Performance Analysis of Arrays and Objects through the lens of Big O Notation.

Collapse
 
xapuu profile image
Xapuu

If you have a sorted array and implement your own search/find method (lets say you implement your own bianary search algorithm) you can definitely achieve better results for the searching scenario, about the traversing it will fall under the : forEach, map, reduce case (that are mentioned in the article) for both the ordered and unordered arrays.