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

A Survey on Security Issues in Wireless Ad hoc Network Routing Protocols

Abstract— An ad hoc wireless network is a collection of wireless mobile nodes that self-configure to construct a network without the need for any established infrastructure or backbone. Ad hoc networks use mobile nodes...

NATURAL LANGUAGE QUERY PROCESSING USING SEMANTIC GRAMMAR

Abstract: The field of natural language processing (NLP) has seen a dramatic shift in both research direction and methodology in the past several years. In the past, most work in computational linguistics tended to focus...

A Comparative Study for Deblured Average Blurred Images

This paper attempts to undertake the study of Restored Average Blurred Images. by using three types of techniques of deblurring image as Wiener filter, Regularized filter and Lucy Richardson deconvlutoin algorithm with a...

Diagnosis and Medical Prescription of Heart Disease Using Support Vector Machine and Feedforward Backpropagation technique

Expert system are used extensively in many domains. Heart disease diagnosis is a complicated process and requires high level of expertise. This paper describes aiming to develop a expert system for diagnosing of heart d...

Distributed Architecture for Transactions Synchronization in Distributed Database Systems

Various concurrency control algorithms have been proposed for use in istributed database systems. But, the number of algorithms available for the distributed concurrency control, come into one of three basic classes: lo...

Download PDF file
  • EP ID EP93014
  • DOI -
  • Views 81
  • Downloads 0

How To Cite

R. Srinivas, A. Raga Deepthi (2013). Novel Sorting Algorithm. International Journal on Computer Science and Engineering, 5(1), 43-46. https://europub.co.uk/articles/-A-93014