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 real-world examples * Find out about important and advanced
data structures such as searching and sorting algorithms *
Understand important concepts such as big-o 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 linked-based data structures * Analyze
types of sorting algorithms * Search algorithms along with hashing
* Understand linear and tree-based 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 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. Style
and approach This easy-to-read book with its fast-paced nature will
improve the productivity of an R programmer and improve the
performance of R applications. It is packed with real-world
examples.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
