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 109
- Downloads 0
Ternary Hierarchical Clustering with Data De-Duplication in Sensor Networks
Wireless Sensor Networks are resource constrained application specific adhoc networks. All the previous works have concentrated on the power aware techniques such as data aggregation, coordination of node operations for...
Association Rule Mining for Both Frequent and Infrequent Items Using Particle Swarm Optimization Algorithm
In data mining research, generating frequent items from large databases is one of the important issues and the key factor for implementing association rule mining tasks. Mining infrequent items such as relationships amon...
A Modified Ant-based Clustering for Medical Data
Ant-based techniques, in the computer sciences, are designed for those who take biological inspirations on the behavior of the social insects. Data-clustering techniques are classification algorithms that have a wide ran...
Method for forecasting the volume of applications using probabilistic classifier based on Bayesian theorem for recruitment in the government organizations
In this paper, we propose a practical method to estimate or forecast the volume of applications based on Bayesian classifier which is a probability method that makes optimal decision based on known probability distributi...
Extraction and Recognition of Text From Digital English Comic Image Using Median Filter
Text extraction from image is one of the complicated areas in digital image processing. Text characters entrenched in image represents a rich source of information for text retrieval application. It is a complex process...