IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v2y2017i6idhcseit11726311.html

Look Back Sort : A Backward Comparison Algorithm for Internal Sorting

Author

Listed:
  • Jyoti Lakhani
  • Kirti Shrimali
  • Dharmesh Harwani

Abstract

Present communication is an attempt to develop a novel algorithm "Look-Back Sort" (LB Sort) for internal sorting. The objective of the present research work was to reduce the space and time complexities of the sorting process in the worst cases. The performance of all internal sorting algorithms in worst cases are bound to O(n log n). To address the issue, the proposed algorithm is implemented first followed by its benchmarking with some other internal sorting algorithms. The empirical analysis of algorithms using C++ function is performed on the numeric samples vary in size. It was observed that the runtime of the LB-sort algorithm is highly comparable with the Quick sort algorithm in the worst case analysis. The overall time complexity of the proposed algorithm is observed to be O(n log k) when k

Suggested Citation

  • Jyoti Lakhani & Kirti Shrimali & Dharmesh Harwani, 2017. "Look Back Sort : A Backward Comparison Algorithm for Internal Sorting," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 2(6), pages 1239-1243, December.
    • Handle: RePEc:jbh:ijsrcs:v2:y2017:i6:id:hcseit11726311
    Note: Article URL: https://ijsrcseit.com/CSEIT11726311
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT11726311
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsrcseit.com/paper/CSEIT11726311.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v2:y2017:i6:id:hcseit11726311. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.