Can someone please help me with a formula I can use to calculate the complexity of an algorithm?

For example, How large a problem can be solved in 1 second using an algorithm that requires f(n) bit operations, where each bit operation is carried out in 10^-9 second, with the following value for f(n) n!

I have several problems like this so I am not necessarily looking for an answer, but a way to solve.