• Sk.Sumiya
• M.Muralidhar

We propose a novel sorting algorithm that sorts input information whole number components on-the-fly with no comparison tasks between the information—comparison-free sorting. We display an entire equipment structure, related planning outlines, and a formal numerical verification, which demonstrate an Overall sorting time, as far as clock cycles, that is directly corresponding to the quantity of information sources, giving a speed multifaceted nature on the request of O (N). Our equipment based sorting algorithm blocks the requirement for SRAM-based memory or complex hardware, for example, pipelining structures, but instead utilizes basic registers to hold the double components and the components' related number of events in the information set, and uses lattice mapping activities to play out the sorting procedure. In this way, the aggregate transistor tally intricacy is on the request of O(N).

DATA SORTING USING EFFICIENT MATRIX TRANSPOSE METHOD

"DATA SORTING USING EFFICIENT MATRIX TRANSPOSE METHOD", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 7, page no.218-222, July-2018, Available :http://www.jetir.org/papers/JETIR1807188.pdf

"DATA SORTING USING EFFICIENT MATRIX TRANSPOSE METHOD", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 7, page no. pp218-222, July-2018, Available at : http://www.jetir.org/papers/JETIR1807188.pdf