If variables
and
are interchanged
to sort
, then
If the Monte-Carlo algorithm is used with this example
(where
), the computed
sample variance for the original problem is approximately 0.0016,
while the computed sample variance for the reordered variable version
of the problem is approximately 0.000064. These results imply that
in order to compute
to some prescribed accuracy level,
the original form of the problem would require approximately
25 times more computation than the reordered variable version of the
problem.