Open AccessAnalysis of MinFinder Algorithm on Large Data Amounts
Publication year - 2021
Publication title -
international journal of emerging trends in engineering research
Language(s) - English
Resource type - Journals
ISSN - 2347-3983
DOI - 10.30534/ijeter/2021/04962021
Subject(s) - sorting , algorithm , sorting algorithm , computer science , stability (learning theory) , data structure , power (physics) , machine learning , physics , quantum mechanics , programming language
When dealing with large amounts of data, various sorting algorithms will be tested and searched for which algorithm is the most efficient. Many factors determine the level of performance of the sorting algorithm, such as time and size complexity, stability, accuracy, clarity, effectiveness, and so on. MinFinder is a newly discovered sorting algorithm by finding the smallest value in each iteration while the program is running. In this paper, the MinFinder algorithm will be tested on the structure of data arrays, vectors and linked lists to compare the speed of completion time. Based on the results of experiments on data with n amount of 10 power of3, 10 power of4, and 10 power of5, it can be concluded that the best application of MinFinder is in the array, with the processing time needed 2X faster than other data structures. Vector and Linked Lists have weaknesses when accessing elements at each iteration, which makes them slower than arrays