Advertisement

A New Approach Toward Sorting Technique: Dual-Sort Extraction Technique (DSET)

  • Darpan Shah
  • Kuntesh Jani
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 10)

Abstract

There is a huge demand for efficient and high scalable sorting techniques to analyze data. Earlier many researchers have proposed various sorting algorithms such as heap sort, merge sort, and bubble sort,. Some of them are very popular in achieving efficient data sorting at a great extent like heap sort and merge sort. Increase in the amount of data has also lead to increase in complexity of sorting algorithms leading to decreased speed and efficiency. For this a new sorting technique named “Dual-Sort Extraction Technique (DSET)”, with two levels of data sorting extraction is proposed which enhances the performance and efficiency of the algorithm.

Keywords

Sorting Extraction Swapping Iteration 

Notes

Acknowledgements

First of all, I would like to thanks my parents who encourage me for my every effort on this precious work. I am thankful to Mr. Kuntesh K Jani who is always standing beside me and appreciate my work. He always motivates me to do this type of job. I am also grateful to many people for their help in writing this research paper.

References

  1. 1.
  2. 2.
    OXFORD University Press “Data Structure Using C” (2nd Edition) by Reema Thareja, Assistant Professor in Department of computer science at Shyama Prasad Mukherjee College for Women, University of Delhi.Google Scholar
  3. 3.
    Technical Publication “Design & Analysis of Algorithm” by Mrs. Anuradha A. Puntambekar. Formerly Assistant Professor in P.E.S. Modern College of Engineering, Pune.Google Scholar
  4. 4.
    SAMS, “Data Structure & Algorithm in Java” by Robert Lafore (1998).Google Scholar
  5. 5.
    Design and Analysis of Algorithms, Dave and Dave, Pearson.Google Scholar
  6. 6.
    Algorithm Design: Foundation, Analysis and Internet Examples, GoodRich, Tamassia, Wiley India.Google Scholar
  7. 7.
    Balaguruswamy for Programming in C (4th Edition).Google Scholar
  8. 8.
    Addison Publication Company “Algorithms” by Robert Sedgewick at Brown University.Google Scholar
  9. 9.
    Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, PHI.Google Scholar
  10. 10.
    Fundamental of Algorithms by Gills Brassard, Paul Bratley, PHI.Google Scholar
  11. 11.
    Introduction to Design and Analysis of Algorithms, Anany Levitin, Pearson.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.Government Engineering College, GandhinagarGujaratIndia

Personalised recommendations