Be the first to like this
The analysis and understanding of sorting strategies are common tasks in the learning process of computational complexity. The classical methods are discussed and their theoretical complexities are confronted, but often there is a deepening and many relevant characteristics of certain techniques are left out there experiencing a confrontation of these practical methods. Also there available, until now, a free tool for measuring the complexity of sorting strategies that takes into account the nature of the samples to be classified. To fill this gap we propose a Wizard Assessment Strategies ordination that has as main functionality to generate random number of clusters, the implementation of specific strategies on these clusters and display of computational effort and time required for implementation.