BRUKID Sort - A New Sorting Approach Using Multi Dimensional Array
Gopi Manoj Vuyyuru, Talasila Dimple, Teja Veerendra Marupudi · 2020
Out of diverse problems in the field of computer sciences, sorting is a primary operation in most applications. Sorting means organizing the data either in increasing order or decreasing order. There are plentiful algorithms that are developed to sort the data. Each algorithm has its own approach and also uses its own mechanism. The main objective of this paper is to reduce the time taken to sort the elements using the multi dimensional array. Here in this paper, a new algorithm is presented which reduces the time complexity by sorting elements based on their size. It is clearly shown in this paper that by arranging the given data based on its size in a multi dimensional array and then applying the sorting over it reduces the sorting time.