Two codes to evaluate the real zeros (j(v,s)) of the Bessel functions of the first kind J(v)(x) for real orders v are presented. The codes are based on a Newton-Raphson iteration over the monotonic function f(v)(x) = x(2v-1) J(v)(x)/J(v-1) (x). The code ELF is a remarkably short program for finding, given any starting value x(0) > 0 and any real order, the zero of J(v)(x) in the neighborhood of x(0) (x(0) and the zero in the same branch of f(v)(x)). GNOME is amodification of ELF for finding the zeros of J(v)(x) inside a given interval [x(min), x(max)]; for simplicity, we restrict the code GNOME to work for v > -1, which is the region of greatest practical use, where all the zeros of J(v)(x) are real. The method is especially efficient for moderate values of v and for small zeros, where asymptotic expansions tend to fail and, besides, contrary to existing algorithms; enables the search of the real zeros for real orders, including negative orders. (C) 1999 Elsevier Science B.V.