In the area of dynamic matching algorithms, the number of changes to the matching per update step, also known as the recourse bound, is an important measure of quality, Nevertheless, the worstcase recourse bounds of almost all known dynamic approximate matching algorithms are prohibitively large, significantly larger than the corresponding update times. In this paper we fill in this gap via a s...