Interesting description, useful topic for almost all developers :-)
the number of operations is decreasing when the number of your inputs grow
Fewer operations when input grows, that would be a cool algorithm :-) That'd be O(1/n) or something though, not O(log(n)).
What is big O?
Urban dictionary does not agree with this answer :-) Sorry, couldn't resist.