Timecomlexity of find list operation

0
Hi, Is find operation in list operation's timecomlexity O(n)?
asked
1 answers
1

Finding in a list is not indexed AFAIK so searching is lineair. Huge lists are slower.

answered