Skip to main content
. Author manuscript; available in PMC: 2014 Oct 24.
Published in final edited form as: Appl Math (Irvine). 2014 Jan;5(1):144–152. doi: 10.4236/am.2014.51017

Figure 5.

Figure 5

Comparison of the efficiency of the built-in STL shuffling procedure and the procedure coded in the naïve way. (a) Naive procedure iterates the steps consisted of picking random element from the vector and then erasing it until the initial vector is empty. Single invocation to the STL procedure gives us the shuffled vector; (b) Evaluation times for those two procedures for different sizes of the shuffled vector.