Mention step-86 in step-52.

diff --git a/examples/step-52/doc/intro.dox b/examples/step-52/doc/intro.dox
index 0b564ada4a2de40b51172849434e24df0771414d..45e48eb4f6a51a91b47a850ad1b468667599415c 100644 (file)
--- a/examples/step-52/doc/intro.dox
+++ b/examples/step-52/doc/intro.dox
@@ -15,6 +15,12 @@ step-26 but, since the purpose of this program is only to demonstrate using
 more advanced ways to interface with deal.II's time stepping algorithms, only
 solves a simple problem on a uniformly refined mesh.
 
+@note At the end of the day, time stepping is a problem that is only solved
+  efficiently if you use adaptive time step selection and error control.
+  This is implemented in many external libraries, but not in deal.II itself.
+  You may want to consider looking at step-86 for a worked out example.
+
+
 
 <h3>Problem statement</h3>