Open AccessJournal Article
VRF: A Novel Algorithm for optimized Sorting
TLDR
A novel sorting algorithm namely „V-Re-Fr (VRF) Sorting Algorithm‟ is proposed to address the limitations of the current popular sorting algorithms and provide improved functionality and reduce algorithm complexities.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.read more
Citations
More filters
Proceedings ArticleDOI
Contrastive analysis of bubble & merge sort proposing hybrid approach
TL;DR: A hybrid approach is proposed that will take minimum number of comparisons, with less time and space complexity to sort, and an example data is sorted with such hybrid approach.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Book ChapterDOI
Introduction to Algorithms
TL;DR: This chapter provides an overview of the fundamentals of algorithms and their links to self-organization, exploration, and exploitation.
Proceedings ArticleDOI
The influence of caches on the performance of sorting
TL;DR: In this article, the effect of cache misses on the performance of sorting algorithms was investigated both experimentally and analytically, and it was shown that high cache miss penalties lead to worse overall performance than the efficient comparison based sorting algorithms.