How to compare two approximation algorithms
I would write something like this: whereas Alg 1 is a $\log(N)$-approximation algorithms, there are instances on which the approximation ratio of Alg 2 is only $N/2$. So Alg 1 is much better (in the worst case) than Alg 2.