C$++$ C$.$ Sorting Arrays

When we swap two variables $x$ and $y,$ the value of $x$ gets copied onto $y$ and vice$-$versa. In general, we utilize a third variable to temporarily store one of the values we are swapping. If we wanted to enforce an order on our array, perhaps an z$-$a reverse lexicographic order, we would then need to swap all of the letters into the correct positions in the array. This means the letter with the lowest ASCII value would be farthest to the left, and the letter with the highest ASCII value would be farthest to the right.

The provided code template gives you a starting point on how to go about enforcing an z$-$a reverse lexicographic ordering $($i$.$e$.$ descending order$)$ on the following array arr.

#include $(b^{\text{'}},f^{\text{'}},a^{\text{'}\text{'},{?}^{\text{'}}{z}^{\text{'}},{?}^{\text{'}}{m}^{\text{'}},{?}^{\text{'}}{g}^{\text{'}},{?}^{\text{'}}{q}^{\text{'}},{?}^{\text{'}}{t}^{\text{'}}}$;$\}i=0$;$i<mn\; id="EditorElement\_65735">8</mn>$;$++ij=i+1$;$j<mn\; id="EditorElement\_65748">8</mn>$;$++\frac{j}{*}*\frac{*}{?}i=0$;$i<mn\; id="EditorElement\_65768">8</mn>$;;