Time complexity of javascript Array.prototype.filter()?

Question

What is the big O of Array.protoype.filter?

I have looked at the documentation (https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/filter) but haven't been able to work it out.

Answer 1

O(N)

Example:

var words = ['spray', 'limit', 'elite', 'exuberant', 'destruction', 'present'];

const result = words.filter(word => isBig(word));

function isBig(word){
  	console.log("called");
	return word.length > 6;
}

Output:

"called" "called" "called" "called" "called" "called" Array ["exuberant", "destruction", "present"]