Looking on the internet deeply has found these results:

requires O(n) is the most popular phrase on the web.

which n its turn calls 10 results on the web	requires O(n) 112,300 results on the web More popular!
Some examples and use cases from the internet:	Some examples and use cases from the internet:
It doesn't look like this phrase is very popular! The search could not find any examples on the internet.	Unfortunately, this requires O(n) extra space for having the arrays a and b available simultaneously. Also, allocation and deallocation are often slow operations. For example, the statement that insertion sort requires O(n2) comparisons is meaningless without defining n, which in this case is the number of elements in the�... Given an array of size n, the partitioning step performs O(n) work in O(log n) time and requires O(n) additional scratch space. After the array has been partitioned,�... ... volume 3: Sorting and Searching, where they'll find that Radix sort takes O(N) time (but requires O(N) space, and places constraints on keys).

which n its turn calls

10 results on the web

requires O(n)

112,300 results on the web

More popular!

It doesn't look like this phrase is very popular! The search could not find any examples on the internet.

Unfortunately, this requires O(n) extra space for having the arrays a and b available simultaneously. Also, allocation and deallocation are often slow operations.
For example, the statement that insertion sort requires O(n2) comparisons is meaningless without defining n, which in this case is the number of elements in the�...
Given an array of size n, the partitioning step performs O(n) work in O(log n) time and requires O(n) additional scratch space. After the array has been partitioned,�...
... volume 3: Sorting and Searching, where they'll find that Radix sort takes O(N) time (but requires O(N) space, and places constraints on keys).