Algorithms : Advanced Data Structures for Algorithms

Andy Vickler

ISBN 10: 1955786488 / ISBN 13: 9781955786485

Edité par Ladoo Publishing LLC, 2023

A propos de cet article

nach der Bestellung gedruckt Neuware - Printed after ordering - Are you studying data science and want to take your learning further Data structures are an integral part of data science, machine learning, and algorithms, all aimed at solving programming challenges that might seem insurmountable at the outset.Advanced Data Structures for Algorithms builds on your current knowledge, taking your learning much deeper and teaching you how to solve even the trickiest of challenges.This book has been divided into four parts:Part One covers advanced lists, including:¿ An overview of linked lists¿ Doubly linked lists¿ XOR linked lists¿ Self-organizing lists¿ Unrolled linked listsPart Two covers trees, including:¿ Segment trees¿ Trie trees¿ Fenwick trees¿ AVL trees¿ Red-black trees¿ Scapegoat trees¿ Treap¿ N-aryPart Three discusses disjoint sets or Union-finds, as they are sometimes knownPart Four covers heaps and priority queues, including:¿ A brief discussion on binary heaps¿ Binomial heaps¿ Fibonacci heaps¿ Leftist heaps¿ K-ary heaps¿ Iterative heapsortsYou'll find plenty of code examples to help you make sense of things and common-sense explanations.If you want to advance your knowledge of data structures for algorithms you are in the right place.

N° de réf. du vendeur 9781955786485

Détails bibliographiques

• Titre: Algorithms : Advanced Data Structures for Algorithms
• Éditeur: Ladoo Publishing LLC
• Date de parution: 2023
• Langue: anglais
• ISBN à 10 chiffres: 1955786488
• ISBN à 13 chiffres: 9781955786485
• Reliure: Taschenbuch
• État de l'article: Neu

A propos de ce titre

Synopsis

Are you studying data science and want to take your learning further ? Data structures are an integral part of data science, machine learning, and algorithms, all aimed at solving programming challenges that might seem insurmountable at the outset.

Advanced Data Structures for Algorithms builds on your current knowledge, taking your learning much deeper and teaching you how to solve even the trickiest of challenges.

This book has been divided into four parts:

Part One covers advanced lists, including:

- An overview of linked lists

- Doubly linked lists

- XOR linked lists

- Self-organizing lists

- Unrolled linked lists

Part Two covers trees, including:

- Segment trees

- Trie trees

- Fenwick trees

- AVL trees

- Red-black trees

- Scapegoat trees

- Treap

- N-ary

Part Three discusses disjoint sets or Union-finds, as they are sometimes known

Part Four covers heaps and priority queues, including:

- A brief discussion on binary heaps

- Binomial heaps

- Fibonacci heaps

- Leftist heaps

- K-ary heaps

- Iterative heapsorts

You'll find plenty of code examples to help you make sense of things and common-sense explanations.

If you want to advance your knowledge of data structures for algorithms you are in the right place.