Абстрактный

KareemNaaz Matrix Divide and Sorting Algorithm

Shaik Kareem Basha

Sorting is a process of arranging data in a specific order according to requirements of Application. Efficient sorting brings orderliness in the data. Many sorting algorithms are proposed. Each algorithm has its own advantages and disadvantages. In this paper an efficient matrix sorting algorithm called as KareemNaaz Matrix Divide and Sorting Algorithm is proposed. The proposed Matrix Sorting Algorithm takes a matrix of order (mxn) as input. It recursively divides the given matrix of order (mxn) into two groups of rows of matrix, based on the middle row. Each group of rows consists of m/2 rows of matrix. First group contains rows from first row to middle row of matrix and second group contains rows from middle+1 row to last row of matrix. Recursively groups of rows are selected and divided into sub groups of rows. If sub group of rows contains only one row, then it is divided into two groups of columns, based upon the middle column of row, each group of columns consists of n/2 columns. First group contains columns from first column to middle column of row, second group contains columns from middle+1 column to last column of row. Recursively groups of columns of row are selected and divided into sub groups of columns. If sub groups of columns contains single column then combine and sorting of those columns takes place. I followed the various stages of Software Development Life Cycle to demonstrate the proposed sorting algorithm. Section I will give introduction about proposed sorting algorithm. In section II, proposed Algorithm is Analyzed and Designed. In section III, proposed algorithm is Implemented using C programming Language. In section IV, I tested the implementation of proposed algorithm using different test cases. In section V, I concluded the proposed Algorithm.