Let $G$ be a discrete subgroup of $GL_n(\mathbb C)$.
Q: If $G$ has infinite order elements, is $G$ algebraic?
I do not think this is the case and it seems that $G$ fails to be algebraic for most of the classical groups I have seen. Consider $SL_2(\mathbb Z)\leq GL_n(\mathbb C)$. Clearly the same defining equations for $SL_2(\mathbb Z)$ will pin down all elements of $SL_2(\mathbb C)$ as the equations have real coefficients. In other words, having integer entries is not an algebraic condition. So any level $N$, the level $N$ congruence subgroup $\Gamma_N\leq SL_2(\mathbb Z)$ is not algebraic as well.
Q': Suppose $G$ is a non-discrete subgroup of $GL_n(\mathbb C)$. Say $G = SL_2(S)$ where $S$ is the integral closure of $\mathbb Q(\sqrt{5})$. Then I do not think this $G$ will be algebraic either. How do I see it is not algebraic?