Development of software for qualitative and comparative performance analysis between some data ordination algorithms
International Journal of Development Research
Development of software for qualitative and comparative performance analysis between some data ordination algorithms
Received 28th March, 2019; Received in revised form 09th April, 2019; Accepted 14th May, 2019; Published online 30th June, 2019
Copyright © 2019, Ricardo Silva Parente et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Ordination can be obtained by common means such as the logical reasoning of a human being, and also by computational means using algorithms to sort the desired data in a predefined order, the present research aims to show the results of the ordering of integers through algorithms, such as Insertionsort, Combsort, Quicksort and Mergesort, through an application developed in the Java programming language, where a performance comparison of each algorithm will be performed, showing not only its performance measured in milliseconds but also aspects fundamental as their operation and the ordering logic employed by them, the results show comparisons of different views according to the complexity worked in each scenario.
