If a problem can be solved using two different algorithms i$.$e$.$ Algo$-1$ with O$($n$!)$ complexity and Algo$-2$ with O$(2^$n$).$

Which algorithm should we select?

a$)$ Anyone can be selected as both have almost same Big O representation

b$)$ Algo$-1$

c$)$ Algo$-2$

d$)$ Depends on the system $($i$.$e$.$ memory, processing power etc.$)$