Max Min Sorting Algorithm A New Sorting Approach
Journal: The International Journal of Technological Exploration and Learning (Vol.3, No. 2)Publication Date: 2014-04-15
Authors : Smita Paira; Sourabh Chandra; Sk Safikul Alam; Subhendu Sekhar Patra;
Page : 405-408
Keywords : Max Min Algorithm; Bubble Sort; Selection Sort; Insertion Sort; Time Complexity.;
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.
Other Latest Articles
- Creep Life Estimation of Low Pressure Reaction Turbine Blade
- Performance Comparison of M-PSK and M-QAM Modulations for WiMAX OFDM system under the Rayleigh Fading Channel
- Fault Tolerant Operation in Aero Engine Using Distributed Computation System
- EMD Techniques of Image Steganography A Comparative Study
- A Suitable Framework for Quality Assurance in Distance Education in Developing Countries
Last modified: 2014-04-29 05:21:20