Finding a maximum matching in a sparse random graph in O(n) expected time