Novel Sorting Algorithm
Journal Title: International Journal on Computer Science and Engineering - Year 2013, Vol 5, Issue 1
Abstract
Sorting has become a stand in need of prosaic life activities. Sorting in computer science alluded to as ordering deals with arranging elements of a list or a set of records of a file in ascending or descending order. We have gone through a number of sorting algorithms like bubble sort, selection sort, insertion sort, shell sort, merge sort and bucket etc. Each algorithm has intrinsic odds and restrictions. We cannot say that a particular algorithm is the best algorithm, because algorithm may be easy to implement but it may take maximum time to execute, where as the other algorithm may be hard to implement but it may save execution time. The time complexity of sorting algorithms is, maximum in the range O(n) to O(n2). Most of the algorithms have O(n2) as worst case time complexity and for few algorithms have O(n) as the best case time complexity. Some algorithms have O(nlogn) as the time complexity in best and or average and or worst cases. We are proposing novel sorting algorithm which has time complexity O(n) in the best case and O(n2)in the worst case.
Authors and Affiliations
R. Srinivas , A. Raga Deepthi
Keywords
Related Articles
- EP ID EP93014
- DOI -
- Views 127
- Downloads 0
Cryptosystem for Information Security
This paper introduces a symmetric cryptosystem for information. Algorithms are described for implementing the proposed method. Cryptanalysis of the proposed scheme is reported along with similar analysis for two popular...
IMPLEMENTATION OF REPUTATION EXCHANGE PROTOCOL IN PEER-TO-PEER SYSTEM
The motivation behind basing applications on peer-to-peer architectures derives to a large extent from their ability to function, scale and self-organize in the presence of a highly transient population of nodes, network...
Comparison of variable learning rate and Levenberg-Marquardt back-propagation training algorithms for detecting attacks in Intrusion Detection Systems
This paper investigates the use of variable learning rate back-propagation algorithm and Levenberg-Marquardt back-propagation algorithm in Intrusion detection system for detecting attacks. In the present study, these 2 n...
Power Saving Scheme (PSS) in Clusters of Heterogeneous ireless Sensor Networks
In this paper, we proposed a Power Saving Scheme (PSS) multi-hop sensor network using partition clusters. It avoids collision and idle listening time of sensor nodes for better overall network life time. The basic sensor...
Classification of Incomplete Data Handling Techniques – An Overview
The task of classification with incomplete data is a complex phenomena and its performance depends upon the method selected for handling the missing data. Missing data occur in datasets when no data value is stored for a...