I was of the understanding that the 'predictor corrector' method consisted of one explicit step method and one implicit method.
I've been asked to implement the following function:
ybarn+1 = yn + (h/12)(23 fn - 16 fn-1 + 5fn-1)
yn+1 = yn + (h/24)(9 fbarn+1 + 19fn - 5fn-1 + fn-1)
where f = dy/dx = -(y+1)(y+3) and fbar = f(x, ybar)
So surely I find ybar(n+1) with an explicit formula, then substitute this into fbar(n+1) and the second equation is also explicit? So is this really a predictor corrector method? Yet it supposedly combines the 3-step Adam Bashforth and Adam Moulton methods.
I've also been asked to find the order of accuracy of this new function, but it appears very similar to that of my (explicit) Adam Bashforth method. Is this a mistake on my part and it should actually be higher order?
Your method is based on the implicit Adams-Moulton method. However, just using the fixed PECE (E=evaluate) schema makes this indeed into an explicit method, as you observed.
One could call this implicit if the corrector step is iterated until an estimate for the error towards the converged value is (widely) below the estimate of the method step truncation error.