A Common-Sense Guide to Data Structures and Algorithms, Second Edition (Pragmatic Bookshelf)

PragmaticBookshelf
Algorithms and data structures are much more than abstract concepts. Mastering them enables you to write code that runs faster and more efficiently, which is particularly important for today’s web and mobile apps.

Jay Wengrow @jaywengrow

edited by Brian MacDonald @bmacdonald

Algorithms and data structures are much more than abstract concepts. Mastering them enables you to write code that runs faster and more efficiently, which is particularly important for today’s web and mobile apps. Take a practical approach to data structures and algorithms, with techniques and real-world scenarios that you can use in your daily production code, with examples in JavaScript, Python, and Ruby. This new and revised second edition features new chapters on recursion, dynamic programming, and using Big O in your daily work.

Use Big O notation to measure and articulate the efficiency of your code, and modify your algorithm to make it faster. Find out how your choice of arrays, linked lists, and hash tables can dramatically affect the code you write. Use recursion to solve tricky problems and create algorithms that run exponentially faster than the alternatives. Dig into advanced data structures such as binary trees and graphs to help scale specialized applications such as social networks and mapping software. You’ll even encounter a single keyword that can give your code a turbo boost. Practice your new skills with exercises in every chapter, along with detailed solutions.

Use these techniques today to make your code faster and more scalable.


Don’t forget you can get 35% off with your Devtalk discount! Just use the coupon code “devtalk.com" at checkout :+1:

19 2284 5

Latest Threads About This Book Top

New
New
JoshuaWLindsay
@jaywengrow “What is the maximum number of steps it would take to perform a binary search on an array of size 100,000?” “To solve this,...
1 498 1
New
New
shannonbarrera
In the second paragraph under the heading “Wrapping Up”, this sentence: Speaking of which, in the next chapter, we’ll discover a new dat...
0 481 1
New
inreoh
Chapter 19 contains: Finally, we reach the -9. This would make the current sum -4, Since the current sum is 6 before encountering -9,...
0 415 0
New
New
inreoh
Chapter 18 contains this sentence: Gina has two neighbors: Derek and Gina. This should be “Gina has two neighbors: Derek and Irena.” ...
0 426 0
New
inreoh
The chapter “Average celsius reading” (p. 143 in the ePub edition) contains this fragment: readings from across many thermometers acros...
0 424 0
New
hayashi
@jaywengrow A Common-Sense Guide to Data Structures and Algorithms - insertion at wrong index (page 140) I tested the example of a link...
0 561 1
New

Most Active This Week Top

Most Active This Month Top

Most Active This Year Top

JoshuaWLindsay
@jaywengrow “What is the maximum number of steps it would take to perform a binary search on an array of size 100,000?” “To solve this,...
1 498 1
New

Most Active Last Three Years Top

New
leba0495
Hello! Thanks for the great book. I was attempting the Trie (chap 17) exercises and for number 4 the solution provided for the autocorre...
0 1147 3
New
aleksa.matiyev
A Common-Sense Guide to Data Structures and Algorithms, Second Edition by @jaywengrow: page 326 - missing param on the def autocomplete...
0 1074 2
New
mattslaven
At the bottom of page 96, “execute three more steps" should be “TWO more steps.” Even numbers have three steps, odd numbers have one step...
1 925 1
New
pjd
On page 379, this part of the Dijkstra shortest path code is supposed to determine the next unvisited city to visit based on it being the...
1 990 4
New
paolotormon
Hi, I am trying to convert the ruby code of Quickselect into python and I noticed that I have to add return statements in the if else con...
0 901 1
New
hayashi
@jaywengrow A Common-Sense Guide to Data Structures and Algorithms - insertion at wrong index (page 140) I tested the example of a link...
0 561 1
New
stdq
Hi, in page 54, there is a line that begins with “To put it this in a way that would hold true…”. I believe it should read “To put this i...
0 812 1
New
dillenbe
Book: A Common-Sense Guide to Data Structures and Algorithms, Second Edition Page 320 Function: collectAllWords Python Version: CPytho...
0 793 1
New
New
pjd
The first complete paragraph on page 428 contains this phrase: “But if we make it to end of the loop…” The word “the” is missing. The se...
0 800 1
New
pjd
The attached image shows the first paragraph on page 433. Toward the end of the first line, the toggling between serif and sans serif fon...
0 785 1
New
pjd
Maybe you were just trying to keep the sum_swap code clean and streamlined for ease of reading, but this method didn’t seem as air-tight ...
1 770 1
New
stdq
Hi, in page 42, before the line with the result of log of 64 in base 2, there is a line that reads as: “Because we had to multiply 2 by ...
0 771 1
New
bakatsuyuki
Maybe best case of improved Intersection Algorithm perform N2/2 comparisons: A Common-Sense Guide to Data Structures and Algorithms, Seco...
0 704 0
New

Most Active Over Three Years Top

New
New
jaywengrow
Hello! It’s Jay Wengrow, author of A Common-Sense Guide to Data Structures and Algorithms. My book now has a supplemental website, where ...
8 1044 3
New
New
GeoffreyBooth
In the answers for the Chapter 13 exercises, there are several uses of JavaScript’s array.sort() to sort an array of numbers. However, th...
4 1064 1
New
New
New
ramoscarlos
On page 331, the subtitle says “Code Implementation: Trie Search,” but the section is about insertion, so it should be “Code Implementati...
3 941 1
New
Mark
Title: A Common-Sense Guide to Data Structures and Algorithms, Second Edition Example: Incorrect time complexity (page 55) Notice the ...
4 909 1
New
New
vhp1895
In chapter 6, Page 93/438. "But now, in the best-case scenario, where the two arrays are identical, we only have to perform N compar...
1 862 1
New
mattslaven
At the bottom of page 85, “position that is greater or equal” should be “smaller”. That is, the loop should stop running once it encounte...
3 885 1
New
Mark
On page 91, there’s an example of an array intersection function that uses a double equals in its comparison line: if (firstArray[i] == ...
3 886 1
New
ikrom
Hello, Can you please check the time complexity of “Count the Ones” on page 102? I got confused. It has 2 loops (outer and inner). Let’s...
0 848 0
New
pjd
In the middle of the page is this sentence: “Once we find the 4, we can delete it one step:” This should instead read, “Once we find th...
0 890 1
New

Book Info

Publisher: Pragmatic Bookshelf

Are you this book's author? To be notified of all posts made about it, sign up an account then click here, then select 'watching' from the bell icon in the top right corner.

Get money off!

The Pragmatic Bookshelf

35% off any eBook

Simply use coupon code "devtalk.com" at checkout. See full details here.