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
- EP ID EP102797
- DOI -
- Views 117
- Downloads 0
RECOVERY ALGORITHM FOR TRANSACTION FRAMEWORK IN WIRELESS MOBILE ENVIRONMENT
Data processing capability and data storage capacity of mobile handheld devices facilitate transaction processing. Normally mobile internet transactions enable multiple users to involve in on-line transaction processing...
Privacy for Semantic Web Mining using Advanced DSA – Spatial LBS Case Study
The Web Services paradigm promises to enable rich flexible d dynamic interoperation of highly distributed, eterogeneous etwork enabled services. The idea of Web ervices Mining that t makes use of the findings in the fiel...
WEB-BASED QUERY BUILDER
Database Management systems are widely used on industries to administer databases like MySQL. The most common way of managing these databases is via long commands or scripts that need to be entered on a console. In some...
Frequent Itemset mining over transactional data streams using Item-Order-Tree
The association rule mining is one of the important area for research in data mining. In association rule mining online association rule mining is one of the hottest area due to the reason that the knowledge embedded in...
Specifying a model of semantic web service composition
One of the major issues of semantic web is the discovery and identification of the best service that responds to a user request. In this article we specify a semantic web services composition model built through an ontol...