Book description
Increase speed and performance of your applications with efficient data structures and algorithms
About This Book
See how to use data structures such as arrays, stacks, trees, lists, and graphs through realworld examples
Find out about important and advanced data structures such as searching and sorting algorithms
Understand important concepts such as bigo notation, dynamic programming, and functional data structured
Who This Book Is For
This book is for R developers who want to use data structures efficiently. Basic knowledge of R is expected.
What You Will Learn
Understand the rationality behind data structures and algorithms
Understand computation evaluation of a program featuring asymptotic and empirical algorithm analysis
Get to know the fundamentals of arrays and linkedbased data structures
Analyze types of sorting algorithms
Search algorithms along with hashing
Understand linear and treebased indexing
Be able to implement a graph including topological sort, shortest path problem, and Prim's algorithm
Understand dynamic programming (Knapsack) and randomized algorithms
In Detail
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 realworld 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 easytoread 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.
Style and approach
This easytoread book with its fastpaced nature will improve the productivity of an R programmer and improve the performance of R applications. It is packed with realworld examples.
Table of contents

R Data Structures and Algorithms
 R Data Structures and Algorithms
 Credits
 About the Authors
 Acknowledgments
 About the Reviewer
 www.PacktPub.com
 Preface
 1. Getting Started
 2. Algorithm Analysis
 3. Linked Lists
 4. Stacks and Queues
 5. Sorting Algorithms
 6. Exploring Search Options
 7. Indexing
 8. Graphs
 9. Programming and Randomized Algorithms
 10. Functional Data Structures
Product information
 Title: R Data Structures and Algorithms
 Author(s):
 Release date: November 2016
 Publisher(s): Packt Publishing
 ISBN: 9781786465153
You might also like
video
Learning Data Structures and Algorithms
In this Learning Data Structures and Algorithms video training course, Rod Stephens will teach you how …
book
Data Structures and Algorithms in Python
Based on the authors' market leading data structures books in Java and C++, this textbook offers …
book
Python Data Structures and Algorithms
Implement classic and functional data structures and algorithms using Python About This Book A step by …
book
HandsOn Data Structures and Algorithms with Python
Learn to implement complex data structures and algorithms using Python Key Features Understand the analysis and …