[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-42885-en":3,"doc-seo-42885-105":30,"detail-sidebar-cat-0-en-105":91},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":21,"is_downloadable":21,"audit_status":21,"page_count":22,"language":23,"language_code":24,"site_id":25,"html_lang":24,"table_of_contents":26,"faqs":27,"seo_title":13,"seo_description":14,"update_tm":28,"read_time":29},42885,549758146520,"Patrick","https://ap-avatar.wpscdn.com/avatar/80002397d8c0411e94?_k=1775819394049821470",6,"Technology","Advanced Algorithms and Data Structures","Advanced Algorithms and Data Structures provides a structured exploration of practical data structures and algorithms, organized from foundational concepts to sophisticated applications. The content map highlights problems such as knapsack, task management, text compression, multi-indexing, balanced trees, memory-efficient contacts, autocomplete, caching and distributed caching, nearest-neighbor and similarity search, clustering, and multiple shortest-path scenarios. It also covers graph topics including planar drawings, segment intersection, flow charts, and performance analysis to select appropriate implementations.","Marcello La Rocca Foreword by Luis Serrano  \nM A N N I N G  \nProblems described in this book  \n\n| Problem | Section | Page Number |\n| --- | --- | --- |\n| 0-1 Knapsack | 1.3, 18.1 |  |\n| Tasks list | 2.2.1 |  |\n| Text compression | 2.8.3 |  |\n| Multi-indexing | 3.1 |  |\n| Keep a tree balanced | 3.4 |  |\n| Memory-efficient contacts list | 4.1 |  |\n| Non-personalized recommendations | 5.1 |  |\n| Spell check | 6. 1, 6.4.1 |  |\n| T9 | 6.4.3 |  |\n| Autocomplete | 6.4.4 |  |\n| Caching | 7.1 |  |\n| Distributed cache | 7.8 |  |\n| Find closest entry on a 2-D map | 8.1 |  |\n| Nearest neighbor search | 9.3.5 |  |\n| Similarity search in multi-dimensional space | 10.4 |  |\n| Closest hub | 11.1 |  |\n| Color reduction (compressing colors) | 11.4.1 |  |\n| Optimization of multidimensional DB queries | 11.4.3 |  |\n| Clustering | 12 |  |\n| Distributed clustering | 13 |  |\n| Shortest path on a map | 14.3.6 |  |\n| Shortest path on a map (with roads) | 14.4.4 |  |\n| Shortest path on a dynamic map | 14.5.2 |  |\n| Drawing flow charts (and generic graphs) on a 2-D plane | 15.1 |  |\n| Graph planarity | 15.2 |  |\n| Segment intersection | 15.4.1 |  |\n\nAdvanced Algorithmsand Data Structures  \nMARCELLO LA ROCCA  \nMANNING  \nSHELTER ISLAND  \nFor online information and ordering of this and other Manning books, please visit [www.manning.com. The publisher offers discounts on this book when ordered in quantity](www.manning.com. The publisher offers discounts on this book when ordered in quantity). For more information, please contact  \nSpecial Sales Department  \nManning Publications Co.  \n20 Baldwin Road  \nPO Box 761  \nShelter Island, NY 11964  \nEmail: [orders@manning.com](orders@manning.com)  \n©2021 by Manning Publications Co. All rights reserved.  \nNo part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by means electronic, mechanical, photocopying, or otherwise, without prior written permission of the publisher.  \nMany of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in the book, and Manning Publications was aware of a trademark claim, the designations have been printed in initial caps or all caps.  \n Recognizing the importance of preserving what has been written, it is Manning’s policy to have the books we publish printed on acid-free paper, and we exert our best efforts to that end. Recognizing also our responsibility to conserve the resources ofour planet, Manning books are printed on paper that is at least 15 percent recycled and processed without the use of elemental chlorine.  \nManning Publications Co. Development editor: Jenny Stout  \n20 Baldwin Road Technical development editor: Arthur Zubarev  \nand Aurelio De Rosa  \nPO Box 761 Review editor: Aleksandar Dragosavljevic  \nShelter Island, NY 11964 Production editor: Deirdre Hiam  \nCopy editor: Katie Petito  \nProofreader: Melody Dolab Technical proofreader: German Gonzalez-Morris  \nTypesetter: Gordan Salinovic  \nCover designer: Marija Tudor  \nISBN 9781617295485  \nPrinted in the United States of America  \nDon’t let fear get in the way and don’t be afraid to say “I don’t know” or “I don’t understand” – no question is a dumb question.  \n—Margaret H. Hamilton  \nSimplicity is a great virtue but it requires hard work to achieve it and education to appreciate it. And to make matters worse: complexity sells better.  \n—Edsger Dijkstra  \nCu `un fa nenti `un sbagghia nenti.  \n(Only those who try make mistakes)  \n—Sicilian proverb  \ncontents  \nforeword xv  \npreface xvii  \nacknowledgments xix  \nabout this book xxi  \nabout the author xxvi  \nabout the cover illustration xxvii  \n1 Introducing data structures 1  \n1. 1 Data structures 2  \nDefining a data structure 2 ■ Describing a data structure 5  \nAlgorithms and data structures: Is there a difference? 5  \n1.2 Setting goals: Your expectations after reading this book 6  \n1.3 Packing your knapsack: Data structures meet the real wo","cbCaih7WvkrIZyEU","https://ap.wps.com/l/cbCaih7WvkrIZyEU","pdf",37036043,3,1,769,"English","en",105,"# Foreword\n# Preface\n# Acknowledgments\n# About this book\n# About the author\n# About the cover illustration\n# Introducing data structures\n## Data structures\n## Setting goals: Your expectations after reading this book\n## Packing your knapsack: Data structures meet the real world\n# Improving over basic data structures\n## Improving priority queues: d-way heaps\n# Treaps: Using randomization to balance binary search trees\n## Problem: Multi-indexing\n## Solution: Description and API","[{\"question\":\"What problem areas does the book address in its algorithm and data-structure roadmap?\",\"answer\":\"It covers problems including knapsack, text compression, multi-indexing, balanced trees, memory-efficient contacts, spell checking and autocomplete, caching, nearest-neighbor/similarity search, clustering, and several shortest-path variants.\"},{\"question\":\"How does the book motivate learning through real-world use cases?\",\"answer\":\"It connects core structures to practical scenarios such as priority in bug tracking, finding k largest elements, minimum distances in graphs, and compression via Huffman codes, tying examples to the underlying algorithmic ideas.\"},{\"question\":\"Which graph-related topics are highlighted for study?\",\"answer\":\"Graph coverage includes drawing flow charts and generic graphs on a 2-D plane, graph planarity, segment intersection, and multiple shortest-path approaches including maps with roads and dynamic maps.\"}]",1783372565,1938,{"code":4,"msg":31,"data":32},"ok",{"site_id":25,"language":24,"slug":33,"title":13,"keywords":34,"description":14,"schema_data":35,"social_meta":86,"head_meta":88,"extra_data":90,"updated_unix":28},"advanced-algorithms-and-data-structures","",{"@graph":36,"@context":85},[37,53,68],{"@type":38,"itemListElement":39},"BreadcrumbList",[40,44,48,50],{"item":41,"name":42,"@type":43,"position":21},"https://docshare.wps.com","Home","ListItem",{"item":45,"name":46,"@type":43,"position":47},"https://docshare.wps.com/document/","Document",2,{"item":49,"name":12,"@type":43,"position":20},"https://docshare.wps.com/document/technology/",{"item":51,"name":13,"@type":43,"position":52},"https://docshare.wps.com/document/advanced-algorithms-and-data-structures/42885/",4,{"url":51,"name":13,"@type":54,"author":55,"headline":13,"publisher":57,"fileFormat":60,"inLanguage":24,"description":14,"dateModified":61,"datePublished":62,"encodingFormat":60,"isAccessibleForFree":63,"interactionStatistic":64},"DigitalDocument",{"name":9,"@type":56},"Person",{"url":41,"name":58,"@type":59},"DocShare","Organization","application/pdf","2026-07-14","2026-07-06",true,{"@type":65,"interactionType":66,"userInteractionCount":20},"InteractionCounter",{"@type":67},"ViewAction",{"@type":69,"mainEntity":70},"FAQPage",[71,77,81],{"name":72,"@type":73,"acceptedAnswer":74},"What problem areas does the book address in its algorithm and data-structure roadmap?","Question",{"text":75,"@type":76},"It covers problems including knapsack, text compression, multi-indexing, balanced trees, memory-efficient contacts, spell checking and autocomplete, caching, nearest-neighbor/similarity search, clustering, and several shortest-path variants.","Answer",{"name":78,"@type":73,"acceptedAnswer":79},"How does the book motivate learning through real-world use cases?",{"text":80,"@type":76},"It connects core structures to practical scenarios such as priority in bug tracking, finding k largest elements, minimum distances in graphs, and compression via Huffman codes, tying examples to the underlying algorithmic ideas.",{"name":82,"@type":73,"acceptedAnswer":83},"Which graph-related topics are highlighted for study?",{"text":84,"@type":76},"Graph coverage includes drawing flow charts and generic graphs on a 2-D plane, graph planarity, segment intersection, and multiple shortest-path approaches including maps with roads and dynamic maps.","https://schema.org",{"og:url":51,"og:type":87,"og:title":13,"og:site_name":58,"og:description":14},"article",{"robots":89,"canonical":51},"index,follow",{"doc_id":7,"site_id":25},{"code":4,"msg":5,"data":92},[93,97,101,105,110,113,118,123,128,131,135],{"id":21,"doc_module":4,"doc_module_name":46,"category_name":94,"show_sort_weight":95,"slug":96},"Story & Novel",90,"story-novel",{"id":47,"doc_module":4,"doc_module_name":46,"category_name":98,"show_sort_weight":99,"slug":100},"Literature",80,"literature",{"id":52,"doc_module":4,"doc_module_name":46,"category_name":102,"show_sort_weight":103,"slug":104},"Exam",70,"exam",{"id":106,"doc_module":4,"doc_module_name":46,"category_name":107,"show_sort_weight":108,"slug":109},5,"Comic",60,"comic",{"id":11,"doc_module":4,"doc_module_name":46,"category_name":12,"show_sort_weight":111,"slug":112},50,"technology",{"id":114,"doc_module":4,"doc_module_name":46,"category_name":115,"show_sort_weight":116,"slug":117},7,"Healthcare",40,"healthcare",{"id":119,"doc_module":4,"doc_module_name":46,"category_name":120,"show_sort_weight":121,"slug":122},8,"Research & Report",30,"research-report",{"id":124,"doc_module":4,"doc_module_name":46,"category_name":125,"show_sort_weight":126,"slug":127},9,"Religion & Spirituality",20,"religion-spirituality",{"id":126,"doc_module":4,"doc_module_name":46,"category_name":129,"show_sort_weight":126,"slug":130},"World Cup","world-cup",{"id":132,"doc_module":4,"doc_module_name":46,"category_name":133,"show_sort_weight":132,"slug":134},10,"Lifestyle","lifestyle",{"id":136,"doc_module":4,"doc_module_name":46,"category_name":137,"show_sort_weight":106,"slug":138},19,"General","general"]