Statistics
23
Views
0
Downloads
0
Donations
Author：Kirupa Chinnathambi
A hands-on, easy-to-comprehend guide that is perfect for anyone who needs to understand algorithms. With the explosive growth in the amount of data and the diversity of computing applications, efficient algorithms are needed now more than ever. Programming languages come and go, but the core of programming--algorithms and data structures--remains the same. Absolute Beginner's Guide to Algorithmsis the fastest way to learn algorithms and data structures. Using helpful diagrams and fully annotated code samples in Javascript, you will start with the basics and gradually go deeper and broader into all the techniques you need to organize your data. Start fast with data structures basics: arrays, stacks, queues, trees, heaps, and more Walk through popular search, sort, and graph algorithms Understand Big-O notation and why some algorithms are fast and why others are slow Balance theory with practice by playing with the fully functional JavaScript implementations of all covered data structures and algorithms Register your book for convenient access to downloads, updates, and/or corrections as they become available. See inside book for details.
Tags
Support Statistics
¥.00 ·
0times
Text Preview (First 20 pages)
Registered users can read the full content for free
Register as a Gaohf Library member to read the complete e-book online for free and enjoy a better reading experience.
Page
1
(This page has no text content)
Page
2
(This page has no text content)
Page
3
OceanofPDF.com
Page
4
About This eBook ePUB is an open, industry-standard format for eBooks. However, support of ePUB and its many features varies across reading devices and applications. Use your device or app settings to customize the presentation to your liking. Settings that you can customize often include font, font size, single or double column, landscape or portrait mode, and figures that you can click or tap to enlarge. For additional information about the settings and features on your reading device or app, visit the device manufacturer’s Web site. Many titles include programming code or configuration examples. To optimize the presentation of these elements, view the eBook in single-column, landscape mode and adjust the font size to the smallest setting. In addition to presenting code and configurations in the reflowable text format, we have included images of the code that mimic the presentation found in the print book; therefore, where the reflowable format may compromise the presentation of the code listing, you will see a “Click here to view code image” link. Click the link to view the print-fidelity code image. To return to the previous page viewed, click the Back button on your device or app.
Page
5
OceanofPDF.com
Page
6
Absolute Beginner’s Guide to Algorithms A Practical Introduction to Data Structures and Algorithms in JavaScript Kirupa Chinnathambi OceanofPDF.com
Page
7
Absolute Beginner’s Guide to Algorithms Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in this book, and the publisher was aware of a trademark claim, the designations have been printed with initial capital letters or in all capitals. The author and publisher have taken care in the preparation of this book, but make no expressed or implied warranty of any kind and assume no responsibility for errors or omissions. No liability is assumed for incidental or consequential damages in connection with or arising out of the use of the information or programs contained herein. For information about buying this title in bulk quantities, or for special sales opportunities (which may include electronic versions; custom cover designs; and content particular to your business, training goals, marketing focus, or branding interests), please contact our corporate sales department at corpsales@pearsoned.com or (800) 382-3419. For government sales inquiries, please contact governmentsales@pearsoned.com.
Page
8
For questions about sales outside the U.S., please contact intlcs@pearson.com. Visit us on the Web: informit.com Library of Congress Control Number: 2023947403 Copyright © 2024 Pearson Education, Inc. Hoboken, NJ Cover image: Rozdesign/Shutterstock All rights reserved. This publication is protected by copyright, and permission must be obtained from the publisher prior to any prohibited reproduction, storage in a retrieval system, or transmission in any form or by any means, electronic, mechanical, photocopying, recording, or likewise. For information regarding permissions, request forms and the appropriate contacts within the Pearson Education Global Rights & Permissions Department, please visit www.pearson.com/permissions. ISBN-13: 978-0-13-822229-1 ISBN-10: 0-13-822229-0
Page
9
$PrintCode OceanofPDF.com
Page
10
Pearson’s Commitment to Diversity, Equity, and Inclusion Pearson is dedicated to creating bias-free content that reflects the diversity of all learners. We embrace the many dimensions of diversity, including but not limited to race, ethnicity, gender, socioeconomic status, ability, age, sexual orientation, and religious or political beliefs. Education is a powerful force for equity and change in our world. It has the potential to deliver opportunities that improve lives and enable economic mobility. As we work with authors to create content for every product and service, we acknowledge our responsibility to demonstrate inclusivity and incorporate diverse scholarship so that everyone can achieve their potential through learning. As the world’s leading learning company, we have a duty to help drive change and live up to our purpose to help more people create a better life for themselves and to create a better world. Our ambition is to purposefully contribute to a world where: Everyone has an equitable and lifelong opportunity to succeed through learning.
Page
11
Our educational products and services are inclusive and represent the rich diversity of learners. Our educational content accurately reflects the histories and experiences of the learners we serve. Our educational content prompts deeper discussions with learners and motivates them to expand their own learning (and worldview). While we work hard to present unbiased content, we want to hear from you about any concerns or needs with this Pearson product so that we can investigate and address them. Please contact us with concerns about any potential bias at https://www.pearson.com/report-bias.html. Register your copy of Absolute Beginner’s Guide to Algorithms on the InformIT site for convenient access to updates and/or corrections as they become available. To start the registration process, go to informit.com/register and log in or create an account. Enter the product ISBN (9780138222291) and click Submit. Look on the Registered Products tab for an Access Bonus Content link next to this product, and follow that link to access any available bonus materials. If you would like to be notified of exclusive offers on new editions and updates, please check the box to receive email from us.
Page
12
OceanofPDF.com
Page
13
Figure Credits FM – Chapter 25: Cute Little Chicks, Rozdesign/Shutterstock Chapter 1: Portrait of adorable raccoon isolated on white background, sonsedskaya/123RF Chapter 2: Happy smiley emoji Vector, MaxxGraphic/Shutterstock FIG04-13, FIG23-01: Cassius Marcellus Coolidge FIG05-01, FIG09-23, FIG14-04, FIG16-18, FIG19-26, FIG19-27: Microsoft FIG07-01: Used with permission from Randall Munroe (xcdc) granted by The Gernert Company Chapter 7, 10, FIG15-01: chick hitching out of an egg, Shahena z/Shutterstock FIG10-01: Atlassian FIG10-29: Notion Labs, Inc. FIG12-24: Apple, Inc. FIG12-25: The New York Times Company FIG12-01, FIG12-22, FIG12-23: Google, Inc. FIG25-01: Winsor McCay OceanofPDF.com
Page
14
Contents at a Glance Part I Data Structures 1 Introduction to Data Structures 2 Big-O Notation and Complexity Analysis 3 Arrays 4 Linked List 5 Stacks 6 Queues 7 Trees 8 Binary Trees 9 Binary Search Trees 10 Heaps 11 Hashtable (aka Hashmap or Dictionary) 12 Trie (aka Prefix Tree) 13 Graphs Part II Algorithms 14 Introduction to Recursion 15 Fibonacci and Going Beyond Recursion 16 Towers of Hanoi 17 Search Algorithms and Linear Search 18 Faster Searching with Binary Search 19 Binary Tree Traversal
Page
15
20 Depth-First Search (DFS) and Breadth-First Search (BFS) 21 Quicksort 22 Bubblesort 23 Insertion Sort 24 Selection Sort 25 Mergesort 26 Conclusion Index OceanofPDF.com
Page
16
Table of Contents I Data Structures 1 Introduction to Data Structures Right Tool for the Right Job Back to Data Structures Conclusion Some Additional Resources 2 Big-O Notation and Complexity Analysis It’s Example Time It’s Big-O Notation Time! Conclusion Some Additional Resources 3 Arrays What Is an Array? Adding an Item Deleting an Item Searching for an Item Accessing an Item Array Implementation / Use Cases Arrays and Memory Performance Considerations Access Insertion
Page
17
Deletion Searching Conclusion Some Additional Resources 4 Linked Lists Meet the Linked List Finding a Value Adding Nodes Deleting a Node Linked List: Time and Space Complexity Deeper Look at the Running Time Space Complexity Linked List Variations Singly Linked List Doubly Linked List Circular Linked List Skip List Implementation Conclusion Some Additional Resources 5 Stacks Meet the Stack A JavaScript Implementation Stacks: Time and Space Complexity
Page
18
Runtime Performance Memory Performance Conclusion Some Additional Resources 6 Queues Meet the Queue A JavaScript Implementation Queues: Time and Space Complexity Runtime Performance Memory Performance Conclusion Some Additional Resources 7 Trees Trees 101 Height and Depth Conclusion Some Additional Resources 8 Binary Trees Meet the Binary Tree Rules Explained Binary Tree Variants What about Adding, Removing, and Finding Nodes? A Simple Binary Tree Implementation
Page
19
Conclusion Some Additional Resources 9 Binary Search Trees It’s Just a Data Structure Adding Nodes Removing Nodes Implementing a Binary Search Tree Performance and Memory Characteristics Conclusion Some Additional Resources 10 Heaps Meet the Heap Common Heap Operations Heap Implementation Heaps as Arrays The Code Performance Characteristics Removing the Root Node Inserting an Item Performance Summary Conclusion Some Additional Resources 11 Hashtable (aka Hashmap or Dictionary) A Very Efficient Robot
Page
20
From Robots to Hashing Functions From Hashing Functions to Hashtables Adding Items to Our Hashtable Reading Items from Our Hashtable JavaScript Implementation/Usage Dealing with Collisions Performance and Memory Conclusion Some Additional Resources 12 Trie (aka Prefix Tree) What Is a Trie? Inserting Words Finding Items Deleting Items Diving Deeper into Tries Many More Examples Abound! Implementation Time Performance Conclusion Some Additional Resources 13 Graphs What Is a Graph? Graph Implementation Representing Nodes
The above is a preview of the first 20 pages. Register to read the complete e-book.
Comments 0
Loading comments...
Reply to Comment
Edit Comment