• Mir omranudin abhar
• Nisha Gatuam

in this paper, we are going to introduce the Square root sorting algorithm. We study the best case and worst case of Square root sorting algorithm, and we compare this algorithm with some of the algorithms that are already existed. A Sorting Algorithm is used to rearrange a given array elements according to a comparison operator on the elements. So far there are many algorithms that have been used for sorting like: Bubble sort, insertion sort, selection sort, quick sort, merge sort, heap sort etc. Each of these algorithms are used according to the list of elements of specific usage and they have specific space complexity and time complexity as well. The Square root sorting algorithm has the least time complexity comparing to some of the existing algorithms, especially in case of the best case, and in the worst case it also has less time complexity than some of the existing algorithms, which we will discuss it in coming pages of this paper.

Algorithm, Complexity, Asymptotic Notation , Analysis

"Square Root sorting algorithm", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.358-362, June-2019, Available :http://www.jetir.org/papers/JETIR1906780.pdf

"Square Root sorting algorithm", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp358-362, June-2019, Available at : http://www.jetir.org/papers/JETIR1906780.pdf