ISSN 2394-5125
 


    Positional Approach for Alphabetic Sort Algorithm (2018)


    Dr. Sunil Mishra (Cse) , Dr. Yogesh Bhomia (Ec), Mr. Ravin Kumar(Cs), Mr. Nawneet Panday (Cs)
    JCR. 2018: 30-32

    Abstract

    In This paper, the authors present a positional algorithmic approach for alphabetic sort. Results are achieved in linear time. Within this approach two embedded algorithms, Binary Search and Counting Sort are executed in parallel to achieve the goal. In this approach a Pre-Processor or Priority Queue is used, which minimizes time complexity. The algorithm is linear in speed. Time Complexity of this newly proposed algorithm is ? (n). The interesting feature of this algorithm is that the order of alphabets is not change and the approach is too much simpler

    Description

    » PDF

    Volume & Issue

    Volume 5 Issue-3

    Keywords

    Algorithm, Priority Queue, Sort, Search, Complexity, Analysis