A COMPARATIVE STUDY OF SORTING ALGORITHMS: EFFICIENCY AND PERFORMANCE IN NIGERIAN DATA SYSTEMS
Abstract
In this research paper, we discuss about comparison of sorting algorithms based on their performance in various scenarios and adaptability to Nigerian context. This article examines five popular sorting algorithms: bubble sort, selection sort, insertion sort, merge sort and quicksort through analysis of time complexity and space complexity. The major goal is to determine the most efficient algorithm with respect to given data sizes and conditions that are typical with computational resources available in Nigeria. It has been found out that when datasets are small, insertion sort and selection sort perform well while for larger datasets one should consider using Merge Sort or Quick Sort because they have lower time complexity O(n log n). In addition, it looks at how these algorithms manage data integrity especially in areas like financial transactions (payments) and educational data management in Nigeria. Tests were performed using integer and string datasets to investigate the practical consequences of applying these sorting algorithms in real-world Nigerian applications. The outcomes show that having an appropriate sorting technique can greatly improve the performance as well as resource utilization across many sectors thus making it one of the ways through which a country can become greater.
References
Aho, A. V., Hopcroft, J. E., & Ullman, J. D. (1983). “Data structures and algorithms”. Addison-Wesley.
Adebayo, S. (2021). “Challenges in Nigerian Electoral Systems”. Journal of Electoral Processes, 12(3), 45-58.
Ayobami, O., et al. (2020). “Efficient data processing techniques for electoral systems in Nigeria”. Journal of Data Science and Technology, 14(2), 34-45.
Aremu, D. R., Adesina, O. O., Makinde, O. E., Ajibola, O., & Agbo-Ajala, O. O. (2013). “A comparative study of sorting algorithms.” African Journal of Computing & ICT, 6*(5), 199-206.
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). “Introduction to algorithms”. MIT Press.
Davis, T. (2017). “Parallel sorting algorithms: An overview.” ACM Computing Surveys, 50(4), 1-35. DOI: https://doi.org/10.1145/3125641
Eze, C. (2022). “Financial Data Processing in Nigeria: Challenges and Solutions”. Nigerian Journal of Banking and Finance, 9(1), 101-119.
INEC. (2023). “INEC Voter Registration Report”. Independent National Electoral Commission.
Johnson, K., Martinez, L., & Wilson, M. (2019). “Memory efficiency in sorting algorithms: An empirical study.” International Journal of Computer Applications, 12 (4), 95-104.
Johnson, R., Smith, J., & Lee, K. (2019). “Performance evaluation of sorting algorithms: A comparative study.” Journal of Computer Science and Technology, 34 (2), 123-135.
Kumar, A., Singh, R., & Gupta, P. (2019). “Hybrid distributed sorting algorithms for large datasets.” International Journal of Computer Applications, 975, 1-6.
Kumar, A., et al. (2019). “Sorting Algorithms in Distributed Networks”. IEEE Transactions on Network Computing, 11(5), 134-146.
Knuth, D. E. (1998). “The art of computer programming, Volume 3: Sorting and searching”. Addison-Wesley.
Levitin, A. (2012). “Introduction to the design and analysis of algorithms”. Pearson.
Lee, H., & Chen, Y. (2021). “Stability in sorting algorithms and its importance in financial systems.” Journal of Information Technology, 22 (2), 123-134.
National Bureau of Statistics (NBS). (2022). “Market price data for agricultural products”. National Bureau of Statistics.
Nigerian Universities Commission (NUC). (2022). “Educational records”. Nigerian Universities Commission.
Nwankwo, J. (2019). “Educational Data Management in Nigeria: Current Practices and Future Directions”. International Journal of Educational Management, 7(2), 89-104.
Olusola, M. (2020). “Market Data Analysis in Nigeria: Tools and Techniques”. Nigerian Journal of Market Research, 5(4), 67-80.
Patel, S., Sharma, R., & Gupta, N. (2018). “Adaptivity of sorting algorithms on nearly sorted data.” Journal of Algorithms and Computational Technology, 10 (1), 33-45.
Smith, J., Doe, A., & Brown, R. (2020). “Performance analysis of sorting algorithms: A theoretical perspective”. Journal of Computer Science, 15 (3), 245-258.
Sedgewick, R., & Wayne, K. (2011). “Algorithms”. Addison-Wesley.
Wang, J., Li, H., & Zhao, Y. (2018). “Performance analysis of parallel sorting algorithms on multi-core architectures.” IEEE Transactions on Parallel and Distributed Systems, 29 (10), 2234-2246.
Wang, P., et al. (2020). “Performance of Parallel Sorting Algorithms in Shared Memory Systems”. Journal of Parallel Computing, 13(4), 98-115.
Copyright (c) 2024 FUDMA JOURNAL OF SCIENCES
This work is licensed under a Creative Commons Attribution 4.0 International License.
FUDMA Journal of Sciences
