R Data Structures and Algorithms: Increase speed and performance of your applications with effi cient data structures and algorithms

Prakash, Dr. PKS

ISBN 10: 1786465159 / ISBN 13: 9781786465153

Edité par Packt Publishing, 2016

A propos de cet article

Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). N° de réf. du vendeur 002341891U

Détails bibliographiques

Titre : R Data Structures and Algorithms: Increase ...

Éditeur : Packt Publishing

Date d'édition : 2016

Reliure : paperback

Etat : Good

A propos de ce titre

Présentation de l'éditeur:

Key Features

• 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

Book Description

In this book, we cover not only the classical data structures, but also functional data structures.

We begin by answering the fundamental question: why data structures and its relationship with algorithms followed by 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 graphs, 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.

Through 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 application of binary search and will go in depth about sorting algorithms such as bubble sort, selection sort, insertion sort, and merge sort.

What you will learn

• Understand the rationality behind data structures and algorithms
• Understand computation evaluation of a program featuring algorithm asymptotic and empirical 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