pllk/cphb

Issues

• Bubble sort code typo

  #97 opened a year ago by zyluo
  1

• Since this book is paired with cses.fi, more string algorithms should be mentioned (Aho Corasick, suffix automaton, KMP)

  #96 opened 2 years ago by mhayter
  0

• sheduling

  #69 opened 6 years ago by dcrystalj
  1

• Suggestion for Section - 5.4 Pruning the Search

  #79 opened 4 years ago by technusm1
  2

• [Suggestion] Add a 5th number of the arithmetic sum example

  #95 opened 2 years ago by dhern023
  0

• Bellman-Ford example has a typo

  #87 opened 3 years ago by vlahovivan
  1

• Errors in Chapter 13

  #89 opened 3 years ago by pllk
  1

• 21.3 Logic needs an explanation

  #91 opened 3 years ago by Zeks
  0

• Can't compile with `latexmk`

  #83 opened 4 years ago by ajilk
  0

• Chapter 15: Minor Typo in Footnote

  #80 opened 4 years ago by Ishan-Dubey
  1

• Update definition of "Maximum subarray problem"

  #81 opened 4 years ago by funnydman
  0

• Search Code on Page 47 is unnecessarily confusing

  #78 opened 4 years ago by wiggles35
  0

• Time complexity to generate table for logK lookup of K succesor of node n

  #77 opened 5 years ago by dpasiukevich
  1

• Update PDF link on https://cses.fi/book/index.php

  #76 opened 5 years ago by odv
  0

• Is this book available in print?

  #75 opened 5 years ago by olavfosse
  2

• Chapter 13: Bellman-Ford negative cycle example

  #73 opened 5 years ago by hieudoan7
  0

• Bellman-Ford example

  #60 opened 7 years ago by pllk
  3

• Citation of this book

  #72 opened 5 years ago by EAR-Development
  1

• Updated pdf

  #71 opened 5 years ago by wilfreddesert
  2

• Chapter 03: Typo at lines 90-91

  #67 opened 6 years ago by arambekverdyan
  1

• A few humble suggestions

  #64 opened 6 years ago by Salil03
  0

• Increasing Subsequence limit

  #63 opened 6 years ago by darbula
  1

• Floyd's algorithm (chapter 16.4)

  #62 opened 6 years ago by checktor
  0

• Elevator example in 10.5

  #61 opened 7 years ago by traxex2
  0

• Typo on chapter06

  #59 opened 7 years ago by alessandro-bugatti
  1

• Time complexity in the 'meet in the middle' example

  #57 opened 7 years ago by alessandro-bugatti
  1

• Maximum subarray sum wrong initialization

  #58 opened 7 years ago by alessandro-bugatti
  2

• Unisigned and 2^n-1

  #56 opened 7 years ago by darbula
  0

• Overflow modpow

  #55 opened 7 years ago by darbula
  0

• Birthday paradox

  #54 opened 7 years ago by darbula
  2

• Memset for distance arrays

  #51 opened 8 years ago by L1nkus
  4

• No ePub or Mobi Available.

  #42 opened 8 years ago by Jon-Schneider
  1

• Question on 27.1 Batch Processing: how to calculate minimum distance to a black square for all white squares in one BFS?

  #52 opened 8 years ago by chao1995
  2

• 9.2 update query

  #44 opened 8 years ago by pllk
  0

• Add merge-technique for tree queries

  #39 opened 8 years ago by pllk
  0

• Policy based data structures

  #46 opened 8 years ago by pllk
  0

• More square root algorithms

  #49 opened 8 years ago by pllk
  0

• 27.2 example problem

  #43 opened 8 years ago by pllk
  0

• 13.2 Dijkstra implementation

  #48 opened 8 years ago by pllk
  0

• Dijsktra algorithm - priority queue

  #41 opened 8 years ago by L1nkus
  3

• Merge 1.6 and 1.7

  #47 opened 8 years ago by pllk
  0

• 10.3 subset iteration

  #45 opened 8 years ago by pllk
  0

• Reference for knight's tour

  #35 opened 8 years ago by pllk
  0

• Square roots (page 20)

  #32 opened 8 years ago by pllk
  1

• Finding ancestors (18.1)

  #31 opened 8 years ago by pllk
  0

• Binary search implementation

  #30 opened 8 years ago by pllk
  1

• Links to problems

  #33 opened 8 years ago by pllk
  3

• Nim analysis

  #40 opened 8 years ago by pllk
  0

• Chapter 25: Page 231

  #37 opened 8 years ago by rishabhkumar296
  0

• Distance (page 259)

  #34 opened 8 years ago by pllk
  0