Hi Dhussar,
There are many ways to do this. Which way depends on your problem and needs. First, how accurate does the solution have to be? How close together and how "curved" is the curve. If close together or not very curved then very simple linear interpolation between points would probably be appropriate. If the curve is represented by sparse points or has a lot of curvature then the best way would probably be to curve fit and equation, probably a polynomial power series, to the points in the vicinity of the intersection, and solve the two equations simultaneously to find the intersection.
Another factor that must be considered is whether the data of the curve is "noisy", e.g., did it come from measurements that contain measurement error? If so a least-squares curve fitting method is appropriate since it allows the errors to exist but minimizes their effects.
Perhaps if you could describe your problem in a bit more detail, I could make more specific recommendations, and even propose a specific algorithm or code.