Home > Store

Absolute Beginner's Guide to Algorithms: A Practical Introduction to Data Structures and Algorithms in JavaScript

Register your product to gain access to bonus material or receive a coupon.

Absolute Beginner's Guide to Algorithms: A Practical Introduction to Data Structures and Algorithms in JavaScript

Best Value Purchase

Book + eBook Bundle

  • Your Price: $45.29
  • List Price: $77.98
  • Includes EPUB and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    Adobe Reader PDF The popular standard, used most often with the free Acrobat® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.

More Purchase Options

Book

  • Your Price: $31.99
  • List Price: $39.99
  • Usually ships in 24 hours.

eBook (Watermarked)

  • Your Price: $30.39
  • List Price: $37.99
  • Includes EPUB and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    Adobe Reader PDF The popular standard, used most often with the free Acrobat® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.

Description

  • Copyright 2024
  • Dimensions: 7" x 9-1/8"
  • Pages: 416
  • Edition: 1st
  • Book
  • ISBN-10: 0-13-822229-0
  • ISBN-13: 978-0-13-822229-1

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.

Sample Content

Online Sample Chapter

Introduction to Data Structures

Sample Pages

Download the sample pages (includes Chapter 1)

Table of Contents

Part I: Data Structures

Chapter 1. Introduction to Data Structures .................................................................. 1

     Right Tool for the Right Job .................................................................................... 2

     Back to Data Structures ........................................................................................... 5

     Conclusion ................................................................................................................. 6

Chapter 2. Big-O Notation and Complexity Analysis ................................................... 7

     It's Example Time ...................................................................................................... 8

     It's Big-O Notation Time! .......................................................................................11

     Conclusion ...............................................................................................................15

Chapter 3. Arrays ....................................................................................................... 17

     What Is an Array? ....................................................................................................18

     Array Implementation / Use Cases .......................................................................24

     Arrays and Memory ................................................................................................26

     Performance Considerations .................................................................................30

     Conclusion ...............................................................................................................32

Chapter 4. Linked Lists ............................................................................................... 35

     Meet the Linked List ...............................................................................................36

     Linked List: Time and Space Complexity .............................................................40

     Linked List Variations ..............................................................................................41

     Implementation .......................................................................................................44

     Conclusion ...............................................................................................................52

Chapter 5. Stacks ........................................................................................................ 53

     Meet the Stack ........................................................................................................54

     A JavaScript Implementation ................................................................................56

     Stacks: Time and Space Complexity ....................................................................58

     Conclusion ...............................................................................................................59

Chapter 6. Queues ..................................................................................................... 61

     Meet the Queue .....................................................................................................62

     A JavaScript Implementation ................................................................................64

     Queues: Time and Space Complexity ..................................................................66

     Conclusion ...............................................................................................................67

Chapter 7. Trees ......................................................................................................... 69

     Trees 101 .................................................................................................................70

     Height and Depth ...................................................................................................75

     Conclusion ...............................................................................................................77

Chapter 8. Binary Trees .............................................................................................. 79

     Meet the Binary Tree ..............................................................................................80

     A Simple Binary Tree Implementation ..................................................................86

     Conclusion ...............................................................................................................89

Chapter 9. Binary Search Trees ................................................................................... 91

     It's Just a Data Structure ........................................................................................93

     Implementing a Binary Search Tree ....................................................................103

     Performance and Memory Characteristics .........................................................110

     Conclusion .............................................................................................................112

Chapter 10. Heaps ...................................................................................................... 113

     Meet the Heap ......................................................................................................114

     Heap Implementation ..........................................................................................126

     Performance Characteristics ................................................................................132

     Conclusion .............................................................................................................134

Chapter 11. Hashtable (aka Hashmap or Dictionary) .................................................. 137

     A Very Efficient Robot ..........................................................................................138

     From Robots to Hashing Functions ....................................................................142

     From Hashing Functions to Hashtables .............................................................145

     JavaScript Implementation/Usage ......................................................................148

     Dealing with Collisions .........................................................................................150

     Performance and Memory ...................................................................................151

     Conclusion .............................................................................................................153

Chapter 12. Trie (aka Prefix Tree) ............................................................................... 155

     What Is a Trie? ......................................................................................................156

     Diving Deeper into Tries ......................................................................................167

     Many More Examples Abound! ..........................................................................172

     Implementation Time ...........................................................................................173

     Performance ..........................................................................................................179

     Conclusion .............................................................................................................181

Chapter 13. Graphs .................................................................................................... 183

     What Is a Graph? ..................................................................................................184

     Graph Implementation .........................................................................................190

     Conclusion .............................................................................................................196

Part II: Algorithms

Chapter 14. Introduction to Recursion ....................................................................... 199

     Our Giant Cookie Problem ..................................................................................200

     Recursion in Programming ..................................................................................202

     Conclusion .............................................................................................................206

Chapter 15. Fibonacci and Going Beyond Recursion ................................................. 207

     Recursively Solving the Fibonacci Sequence ....................................................209

     Recursion with Memoization ...............................................................................213

     Taking an Iteration-Based Approach ..................................................................215

     Going Deeper on the Speed ..............................................................................217

     Conclusion .............................................................................................................218

Chapter 16. Towers of Hanoi ...................................................................................... 221

     How Towers of Hanoi Is Played ..........................................................................222

     The Single Disk Case ...........................................................................................223

     It's Two Disk Time .................................................................................................224

     Three Disks ............................................................................................................225

     The Algorithm .......................................................................................................228

     The Code Solution ...............................................................................................229

     Check Out the Recursiveness! ............................................................................231

     It's Math Time ........................................................................................................232

     Conclusion .............................................................................................................234

Chapter 17. Search Algorithms and Linear Search ..................................................... 235

     Linear Search .........................................................................................................236

     Conclusion .............................................................................................................241

Chapter 18. Faster Searching with Binary Search ....................................................... 243

     Binary Search in Action ........................................................................................243

     The JavaScript Implementation ..........................................................................250

     Runtime Performance ...........................................................................................254

     Conclusion .............................................................................................................257

Chapter 19. Binary Tree Traversal ............................................................................... 259

     Breadth-First Traversal ..........................................................................................260

     Depth-First Traversal ............................................................................................265

     Implementing Our Traversal Approaches ..........................................................270

     Performance of Our Traversal Approaches ........................................................278

     Conclusion .............................................................................................................279

Chapter 20. Depth-First Search (DFS) and Breadth-First Search (BFS) ....................... 281

     A Tale of Two Exploration Approaches ..............................................................282

     It's Example Time ..................................................................................................285

     When to Use DFS? When to Use BFS? ..............................................................298

     A JavaScript Implementation ..............................................................................300

     Performance Details .............................................................................................307

     Conclusion .............................................................................................................308

Chapter 21. Quicksort ................................................................................................ 309

     A Look at How Quicksort Works .........................................................................310

     Another Simple Look ...........................................................................................314

     It's Implementation Time .....................................................................................319

     Performance Characteristics ................................................................................322

     Conclusion .............................................................................................................323

Chapter 22. Bubblesort .............................................................................................. 325

     How Bubblesort Works ........................................................................................326

     Walkthrough ..........................................................................................................329

     The Code ...............................................................................................................333

     Conclusion .............................................................................................................333

Chapter 23. Insertion Sort .......................................................................................... 335

     How Insertion Sort Works ....................................................................................336

     One More Example ..............................................................................................347

     Algorithm Overview and Implementation .........................................................349

     Performance Analysis ...........................................................................................351

     Conclusion .............................................................................................................353

Chapter 24. Selection Sort ......................................................................................... 355

     Selection Sort Walkthrough .................................................................................356

     Algorithm Deep Dive ...........................................................................................364

     The JavaScript Implementation ..........................................................................366

     Conclusion .............................................................................................................369

Chapter 25. Mergesort ............................................................................................... 371

     How Mergesort Works .........................................................................................372

     Mergesort: The Algorithm Details ......................................................................379

     Looking at the Code ............................................................................................380

     Conclusion .............................................................................................................381

Conclusion .................................................................................................................383

Index ............................................................................................................................ 387

Updates

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020