Sorting an essential required operation of the data structure which makes ease of arrangement, locating and searching of the list of information. Article discussing a new type of sorting algorithm in the data structure to sort a given list of elements on the basis of continuous comparison of four corresponding elements. The known sorting algorithm like bubble sort, selection sort, and heap sort, sort one element at a time with many comparisons but Mesh sort algorithm sorts two elements at a time and move two biggest elements of them in last of the list and these sorted element not get back check for comparison in next steps, furthermore. So this article discuss a detail study of Mesh sort sorting method and provide details about that how this sorting algorithm is working and how this sort is better from another sort and what are the advantages of this sorting algorithm and discussing the main overlapping feature of this sorting on the other comparison based sorting algorithms with its performance parameter.
Here, in this sorting, the elements are compared on the principle idea of Mesh topology. In Mesh topology, a network setup in which each computer and network devices are connected to one another which allows most transmission to be distributed in the network. In the context of Mesh sort, the four consecutive elements are connected, as four computer is connected in a mesh topology and set of comparisons are made to get the list of four sorted elements. Mesh sort algorithms sort the information while making the comparison between information and sort till the whole list of data gets sorted. Mesh sort algorithm has tendency to sort the list of element in just (length/2) -1 passes of the loop with 0(n2) complexity. The conclusion of the efficiency of the algorithm is determined by its complexity and space is required in the memory O (n).
OBJECTIVE OF THE INVENTION
The main objective of this invention is to deal with a new method and a procedure to generate an optimal solution for the searching and sorting on the basis of the mesh topology and its principle..

BRIEF DESCRIPTION OF DRAWINGS
The Mesh sort algorithm process start(l) with read length (2) from the user end after that decision (3) and decision(4)check the condition whether the length is greater than or equal to 3 and checks the length should be even and if it is even than algorithm moves to process (5) and if not even increase the length by 1 and assign array[length]=0 , while this steps forwarded to process(5), where the outvalue and innvalue are computed in this process and read the data from the user . The process(7) initiate the iteration for 1=0 and decision (9) check the second iteration for j i.e j