COMPARATIVE STUDY OF TWO DIVIDE AND CONQUER SORTING ALGORITHMS: QUICKSORT AND MERGESORT-Reference-Cited by-同舟云学术

COMPARATIVE STUDY OF TWO DIVIDE AND CONQUER SORTING ALGORITHMS: QUICKSORT AND MERGESORT

Author:

Esau Taiwo Oladipupo,Christianah Abikoye Oluwakemi,Oluwatobi Akande Noah,Aderonke Kayode Anthonia,kehinde Adeniyi Jide

Publisher

Elsevier BV

Subject

General Engineering

Reference15 articles.

1. Aditya, DM., Deepak, G. Selection of Best Sorting Algorithm. International Journal of Intelligent Information Processing. 2008; 363-368.

2. Anonnymous. Sorting and Efficient Searching. Lecture Note. Unpublished. 2008

3. Introduction to Algorithms (Third ed;Cormen,2009

4. A comparative Study of Selection Sort and Insertion Sort Algorithms;Fahriye;International Journal of Engineering and Technology (IRJET).,2016

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Data Packet Sorting Method Based on Field-Programmable Gate Arrays On-Chip Random Access Memory;2024 4th Asia-Pacific Conference on Communications Technology and Computer Science (ACCTCS);2024-02-24

4. TWEERIFY: A Web-Based Sentiment Analysis System Using Rule and Deep Learning Techniques;Proceedings of International Conference on Computational Intelligence and Data Engineering;2022