Abstract Many algorithms are available for sorting the unordered elements. Most important of them are Bubble sort, Heap sort, Insertion sort and Quick sort. This paper presents the new algorithm for sorting the elements which is based on minimum and maximum elements of the array which results in placing the elements at appropriate position. This will reduce the number of passes in which the sorting takes place. We will examine this sorting technique and compare with the other available sorting algorithms in terms of complexity, memory and other factors. 1. INTRODUCTION Sorting has been a profound area for the algorithmic researchers. And many resources are invested to suggest a more working sorting algorithm. For this purpose many existing sorting algorithms were observed in terms of the efficiency of the algorithmic complexity. Since the dawn of computing, the sorting problem has attracted a great deal of research [1]. Till date, Sorting algorithms are open problems and many researchers in past have attempted to optimize them with optimal space and time scale. This paper describes the new sorting algorithm named Min-Max Sorting based on minimum and maximum element. This algorithm finds the minimum and maximum element from the array and placed in first and last position of the array. Then it increment the array index from the first position and decrement the array index from the last position, from this we find the new array and from this new array again we find the minimum and maximum element and placed in first and last position of the new array and so on. In this way, number of passes is reduced to sort the number of elements and it also reduces the time which the algorithm takes to sort the numbers. This paper includes:  Section 2 describes the proposed algorithm.  Section 3 describes the comparative study with the other algorithms.  Section 4 describes the conclusion. 2. PROPOSED ALGORITHM The Min-Max Sorting Algorithm works on the minimum and maximum element of the array. It finds the minimum and maximum element from the array and set on the first and last position of the array. Then the array index increment from the first position and decrement from the last position to get the new array. From this new array, it again finds the minimum and maximum element and set on their respective positions. In this way, this sorting algorithm sorts the elements of the array. Here we provide the Pseudo-Code for this sorting algorithm. Pseudo-Code for Min-Max Sorting 1. Set p:=0,q:=n-1 //n is the number of elements 2. while p<q do: Repeat steps 3 to 6 3. Minimum(a,p,q) //pass array,p,q to find minimum element of current array 4. Maximum(a,p,q) //pass array,p,q to find maximum element of current array 5. Set p:=p+1 //increment p 6. Set q:=q+1 //increment q 7. End while 8. Print sorted array //end of algorithm Pseudo-Code for finding the minimum element from the array: Pseudo-Code for Minimum Function Minimum(int a[],int p,int q) //Receive array,p,q 1. Set min:=a[p] //set the first element of array to min 2. for l=p to q do: Repeat Steps 3 to 5 3. if a[l]<min then 4. swap(a[l],min) //swapping is done and find the minimum element 5. Set l:=l+1; 6. End for 7. a[p]=min Pseudo-Code for finding the maximum element from the array: A New Approach To Sorting: Min-Max Sorting Algorithm Aayush Agarwal Vikas Pardesi Namita Agarwal M.Tech, CDAC Noida M.Tech, DTU, Delhi B.Tech, BITS, Sonepat 445 International Journal of Engineering Research & Technology (IJERT) Vol. 2 Issue 5, May - 2013 ISSN: 2278-0181 www.ijert.org