Write a bin sort and radix sort algorithm using linked lists. Compare their runtime with algorithms implemented using lists.
Rewrite the original selection sort algorithm such that redundant swaps (of the same elements) are removed, and also compare its system runtime with the original algorithm.
Out of the following, which algorithm preserves the original ordering of duplicate elements in the input vector? Can you suggest modifications which can prevent redundant swaps from occurring?
Insertion sort
Bubble sort
Selection sort
Shell sort
Merge sort
Quick sort
Heap sort
Bin sort
Radix sort
Can you prove why comparison-based sorting algorithms require a minimum asymptotic complexity of O(nlog n) for worst-case scenarios?
Compare the empirical performance of merge sort using vector-based and linked list based implementation.
R Data Structures and Algorithms
By :
R Data Structures and Algorithms
By:
Overview of this book
In this book, we cover not only classical data structures, but also functional data structures.
We begin by answering the fundamental question: why data structures? We then move on to cover the relationship
between data structures and algorithms, followed by an analysis and evaluation of algorithms. We introduce the fundamentals of data structures, such as lists, stacks, queues, and dictionaries, using real-world examples. We also cover topics such as indexing, sorting, and searching in depth.
Later on, you will be exposed to advanced topics such as graph data structures, dynamic programming, and randomized algorithms. You will come to appreciate the intricacies of high performance and scalable programming using R. We also cover special R data structures such as vectors, data frames, and atomic vectors.
With this easy-to-read book, you will be able to understand the power of linked lists, double linked lists, and circular linked lists. We will also explore the application of binary search and will go in depth into sorting algorithms such as bubble sort, selection sort, insertion sort, and merge sort.
Table of Contents (17 chapters)
R Data Structures and Algorithms
Credits
About the Authors
Acknowledgments
About the Reviewer
www.PacktPub.com
Preface
Free Chapter
Getting Started
Algorithm Analysis
Linked Lists
Stacks and Queues
Sorting Algorithms
Exploring Search Options
Graphs
Programming and Randomized Algorithms
Functional Data Structures
Customer Reviews