In this paper we describe a randomized greedy algorithm for obtaining bisections of graphs. Analysis of the algorithm's performance on random d-regular graphs yields asymptotically almost sure upper bounds on the bisection width of such graphs with n vertices, as n goes to infinity. We also give empirical values of the size of bisection found by the algorithm for some small values of d.