ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Max Min Sorting Algorithm A New Sorting Approach

Journal: The International Journal of Technological Exploration and Learning (Vol.3, No. 2)

Publication Date:

Authors : ; ; ; ;

Page : 405-408

Keywords : Max Min Algorithm; Bubble Sort; Selection Sort; Insertion Sort; Time Complexity.;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

There are many popular problems in different practical fields of computer sciences, database applications, etc. One of these basic operations is the sorting algorithm. It has attracted a great deal of research. A lot of sorting algorithms has already been developed. These algorithms have enhanced the performance in terms of computational complexity, taking into consideration some factors like time complexity, stability, space complexity, etc. Information growth rapidly in our world leads to increase developing sort algorithms. This paper deals with introducing a new sorting technique that will try to overcome some of the common drawbacks of the basic conventional algorithms.

Last modified: 2014-04-29 05:21:20