Upgraded Selection Sort

Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 4

Abstract

Sorting is a technique which is frequently used in our day to day life. It has a direct implication on searching. If the data is sorted on any key attribute, finding data based on that key attribute becomes very fast. There are many sorting algorithm that are being used in practical life as well as in computation. We will concentrate on selection sort in this context that has already been used for so many years and are providing a solution to make it more faster as compared to previous one. The upgraded Selection sort works by repeatedly selecting the minimum or the maximum value and placing them in their proper position in the list. We provide a method of selecting both the minimum and the maximum value simultaneously and placing them in their respective positions in a single pass. so that the length of array reduces by two elements in each pass which reduces the number of passes by n/2.Thus array get sorted in ascending order from the beginning of the array, and in descending order from the end and hence the sorting is done from both the ends of the array and hence the array is sorted in less time using this upgraded selection sort as compared to the original selection sort. The complexity of the upgraded selection sort provided in this work comes out to be same as that of the original selection sort О(n2) but the total number of passes in the original selection sort is n and in upgraded algorithm is n/2.

Authors and Affiliations

Sunita Chand, , Teshu Chaudhary, , Rubina Parveen

Keywords

Related Articles

A Review of Feature Selection Algorithms for Data Mining Techniques 

Feature selection is a pre-processing step, used to improve the mining performance by reducing data dimensionality. Even though there exists a number of feature selection algorithms, still it is an active research area i...

Position-Based Clustering: An Energy-Efficient Clustering Hierarchy for Heterogeneous Wireless Sensor Networks

A clustering algorithm is a key technique used to increase the scalability and lifetime of the Wireless Sensor Networks (WSNs). In this paper, we propose and evaluate a distributed energy-efficient clustering algorithm f...

DERIVATION OF CUSTOMER INTELLIGENCE FROM CUSTOMER KNOWLEDGE MANAGEMENT

In today’s world, knowledge has turned into a main element of the financial management. In fact, knowledge is the most essential strategic asset and the capacity to pick up and extend it, spread and apply it can remain t...

Digital Logic Embedding Using Single Row

We present a technique to improve embedding capacity of Image using digital logic in this paper. We have applied digital logic operations on two equal halves of an image row to derive the hidden information. We have also...

Improving Capacity of soft Handoff Performance in Wireless Mobile Communication using Macro Diversity

The soft handoff is a process on transferring the on going call from one radio resource to another radio resource without any interruption. Rather, mobile unit looks next base station for possible new connection without...

Download PDF file
  • EP ID EP102797
  • DOI -
  • Views 91
  • Downloads 0

How To Cite

Sunita Chand, , Teshu Chaudhary, , Rubina Parveen (2011). Upgraded Selection Sort. International Journal on Computer Science and Engineering, 3(4), 1633-1637. https://europub.co.uk/articles/-A-102797