Are there any O(1/n) algorithms?

Question

Are there any O(1/n) algorithms?Or anything else which is less than O(1)?

Answer 1

The short answer is no, all O(1) means is that the algorithm runs in constant time, and there is no way to write a program that runs in sub-constant time. Another way of seeing this is asking what a O(1/n) would mean logically. This would mean that as n got larger and larger, n being the number of objects being operated on (i.e the amount of data in a list) the time to complete the program became smaller and smaller. It would be impossible to write a program that ran faster and faster as it operated on more and more things.