Suppose we determine that using language supplied recursion introduces excessive overhead. Furthermore, we find that an iterative control program using an explicit Stack as contentual context could be more efficient. We thus define an alternate form of Sort content, Iterative_Quick_Sort, using both the Partition concept and a Stack concept as contentual context.
It might also be advantageous to implement a Sort algorithm that is a combination of quick sort and insertion sort. This sort content, which we call RQ_Other_Sort, would be parameterized by the contentual context of the Partition concept and again the Sort concept. The details of Insertion_Sort as content are hidden by this Sort contentual context parameter.