Status Updates From Grokking Algorithms An Illu...

Chapter 5
Hash tables

Chapter 4
Quicksort
O(n)
O(n log n)

Chapter 3
Recursion
The stack

Chapter 2
Arrays
Linked lists
Selection short

Thema 1
Linear search
Binary search

Big O notation

must read

i'm enjoying the book so far!

Excited to get started

I have to reread & complete https://gitlab.com/husen_hn/algorithms repository

Finished the greedy algorithm chapter.

Finished breadth-first search chapter.

Finished hash tables chapter.

Finished Quicksort.

Finished Ch. 1.

On Ch 3 of 11

On chapter 2 of 11

Tada!

Thanks for the recc Alex :)

Clear explanations, and fun to read.

This book is so good!

GREAT fundamental read about algorithms for people who are new to computer science (so far)

great stuff

"Sometimes, perfect is the enemy of good. Sometimes all you need is an algorithm that solves the problem pretty well. " - Greedy Algorithms

My eye was bleeding last night but I managed to read 20%. Let's finish it this weekend and get back to the Algorithms.

This is an excellent book so far. It's about 95% review for me so far (with some fun and surprising stuff like a *very* detailed and excellent explanation of recursion/the call stack in the chapter I just finished), but presently in a very engaging way. I wish I had encountered this book back in my early career days, before or during my bootcamp! It makes light work of many challenging concepts so far.

and I think that the presentation of content is generally good. However, the overall feeling is that I received a draft that got sent to the printer to generate revenue with minimal effort on the part of the editor rather than a finished product.

I was excited about this book but the editing is so terrible that it is quite ruined. The first segment of code has an error that breaks the example (takes the sum of the high and low values rather than taking their average in the binary search). At the end of chapter 2 it mentions that quicksort is in the next chapter but it doesn't appear until chapter 4. The factorial function can't handle 0!
The book had promise

"Às vezes, o melhor é inimigo do bom."

"O melhor é inimigo do bom."

A good introduction to commonly used algorithms and data structures.
Too sad python doesn't have tail call elimination so some of the algorithms need to be rewritten to be usable on larger data.