IDEAS home Printed from https://ideas.repec.org/a/ijs/ijsrse/v2y2016i2idhijsrset1622366.html

VRF: A Novel Algorithm for optimized Sorting

Author

Listed:
  • Sunny Sharma
  • Vinay Kumar
  • Prithvipal Singh
  • Amritpal Singh

Abstract

An algorithm is a well-defined way that takes some input in the form of certain values, processes them and gives certain values as output. Although there is a large variety of sorting algorithms, sorting problem has appealed a great deal of research; because effective sorting is important to enhance the use of other algorithms.A novel sorting algorithm namely ‘V-Re-Fr (VRF) Sorting Algorithm’ is proposed to address the limitations of the current popular sorting algorithms. The goal of this paper is to propose a new algorithm which will provide improved functionality and reduce algorithm complexities. The observations backed by literature survey indicates that proposed algorithm is much more efficient in terms of number of swaps or iterations than the other algorithms having O(n2) complexity, like insertion, selection and bubble sort algorithms.

Suggested Citation

  • Sunny Sharma & Vinay Kumar & Prithvipal Singh & Amritpal Singh, 2016. "VRF: A Novel Algorithm for optimized Sorting," International Journal of Scientific Research in Science, Engineering and Technology, International Journal of Scientific Research in Science, Engineering and Technology, vol. 2(2), pages 1072-1076, December.
    • Handle: RePEc:ijs:ijsrse:v2:y2016:i2:id:hijsrset1622366
    Note: Article URL: https://ijsrset.com/IJSRSET1622366
    as

    Download full text from publisher

    File URL: https://ijsrset.com/IJSRSET1622366
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsrset.com/paper/1220.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:ijs:ijsrse:v2:y2016:i2:id:hijsrset1622366. 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 (email available below). General contact details of provider: https://ijsrset.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.