MEDIAN FIRST TOURNAMENT SORT

Abstract

Rearrangement of things for making it more usable needs a mechanism to do it with a practically possible time. Sorting techniques are most frequently used mechanism used for rearrangement. Selection of a procedure to sort something plays vital role when the amount to be sorted is large. So the procedure must be efficient in both time and space when it comes to the matter of implementation. Several sorting algorithms were proposed in past few decades and some of them like quick sort, merge sort, heap sort etc. widely using in real life scenarios since they found their way to be top on the list of sorting mechanisms ever proposed. This paper proposing a Median first Tournament Sort which practically beats quick, merge, and heap sorting mechanisms in terms of time and number of swaps required to sort.

Authors and Affiliations

MUKESH SONI, DHIRENDRA ` PRATAP SINGH

Keywords

Related Articles

NATURE INSPIRED ALGORITHMS FOR TEST SUITE OPTIMIZATION FOR REGRESSION TESTING: AN INVESTIGATION

Software Testing is one of the expensive activities in software development. But at the same time, it will assure the quality of the software product. Software testing will take more cost and maximum time which actually...

An Application of Artificial Intelligence with Vector Quantization for Image Compression

This paper uses two compression techniques on an image, namely, Vector Quantization (VQ) and Feed Forward Neural Network (FFNN). VQ is used along with K-Mean clustering to initiate the centroids and form the codebook. Th...

SMART MOTIF DISCOVERY ON ECG SIGNAL USING AUTOCORRELATION AND VARIABLE THRESHOLD

The ECG signal is the prominent solution to determine the heart beat rate of the person to evaluate the health of heart. The telemedicine or body area networks have enabled the remote live ECG monitoring of the patients...

PRIVACY PRESERVING FOR NUMERIC DATA QUERY IN CLOUD COMPUTING

In the present situation, organizations and individuals are outsourcing database to limit their exertion and to get a minimal effort benefit. Keeping in mind the end goal to give the adequate usefulness to SQL inquiries,...

ENHANCED K STRANGE POINTS CLUSTERING USING BAT INSPIRED ALGORITHM

One of the major techniques for data analysis is Clustering in data mining . In this paper, a partitioning clustering method called the Enhanced K Strange Points Clustering algorithm (EKSPA) is used with Bat algorithm. T...

Download PDF file
  • EP ID EP220319
  • DOI -
  • Views 162
  • Downloads 0

How To Cite

MUKESH SONI, DHIRENDRA ` PRATAP SINGH (2017). MEDIAN FIRST TOURNAMENT SORT. International Journal of Computer Science Engineering and Information Technology Research (IJCSEITR), 7(1), 35-52. https://europub.co.uk/articles/-A-220319