The Curious Case of Modified Merge Sort

Autor:	Gopal Chaudhary, Vanita Jain, Harsh Sagar Garg
Rok vydání:	2020
Předmět:	Insertion sort Bubble sort Sorting algorithm Selection sort Theoretical computer science Computer science Radix sort Data_FILES Sorting sort Merge sort
Zdroj:	Proceedings of International Conference on Artificial Intelligence and Applications ISBN: 9789811549915
DOI:	10.1007/978-981-15-4992-2_45
Popis:	We propose an O(N logN) sorting method by Modified Merge Sort Method, which shows huge potential to sort big data sets, and even better potential to sort big data sets with a smaller range. Six sorting algorithms: Selection Sort, Insertion sort, Merge sort, Quick sort, Bubble Sort and Modified Merge Sort were implemented in C++ programming languages and tested for the random sequence input of length 100, 1000, 4000, 9000 on random numbers and the IPL Dataset.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::1a33d62f09fb186e89c653c63b75c89c https://doi.org/10.1007/978-981-15-4992-2_45 Zobrazit plný text záznamu