Active Threads:

## Most Active This Week

## Most Active This Month

## Most Active This Year

Title: A Common-Sense Guide to Data Structures and Algorithms, Second Edition by @jaywengrow
In exercise #3 of chapter #7, I suggest cl...

New

On page 265 you describe the process for moving a sucessor node that has a right child. The successor node moves into the position of the...

New

Hello,
There is a way to avoid unnecessary step in exercise 4 on page 111 (ch. 7).
Since you already calculating for the array indexes ...

New

@jaywengrow
Like Quicksort, Heapsort is O(N log N). This is because we need to insert N values into the heap, and each insertion takes l...

New

On Chapter 2 - Exercise Question 3, shouldn’t we change the answer to 17 times to avoid ambiguity and to answer the question “What is the...

New

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 ...

New

## Most Active Last Three Years

## 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.