Algorithmic complexity of php functions

Question

PHP

Good day, colleagues. Have you seen somewhere on the Internet a description of php functions in terms of algorithmic complexity?

Answer 1

stackoverflow.com/questions/2473989/list-of-big-o-for-php-functions

Answer 2

Try to determine the complexity by experimenting (at least, this method is one of the first that comes to mind), giving different data to the input, averaging the execution time of the function and plotting the dependence of the average time on the length of the input data. It seems to me that this can be interesting, and well-written material can be enough for an article in a peer-reviewed journal or on Habré.
Again, experimentation takes quite a lot of time, sometimes it's easier to evaluate the code.

Answer 3

In some test task, they sent me a question about the algorithmic complexity of the strlen function. I found it in the source rather quickly.