Let $\mathcal{H}$ be a $t$-regular hypergraph on $n$ vertices and $m$ edges. Let $M$ be the $m \times n$ incidence matrix of $\mathcal{H}$ and let us denote $λ=\max_{v \perp \overline{1},\|v\| = 1}\|Mv\|$. We show that the discrepancy of $\mathcal{H}$ is $O(\sqrt{t} + λ)$. As a corollary, this gives us that for every $t$, the discrepancy of a random $t$-regular hypergraph with $n$ vertices and $m \geq n$ edges is almost surely $O(\sqrt{t})$ as $n$ grows. The proof also gives a polynomial time algorithm that takes a hypergraph as input and outputs a coloring with the above guarantee.