Programming Pearls in Golang
Each problem is identified by its package import path and may be conveniently fetched, built, and installed using the go get command.
To run all the benchmarks
go test -v -bench=. -tags benchmark ./...
Problem |
Description |
2.6.1 |
Anagram |
2.6.2 |
Find integer that appears at least twice in sequential file |
2.6.3 |
Rotation algorithms |
2.6.8 |
K-element subset of the set that sums to at most t |
Problem |
Description |
9.5.1 |
Sequential Search |
9.5.4; 9.5.8 |
Maximum value in array |
9.5.6 |
Character Classification using masks |
9.5.7 |
Count Set Bits |
9.5.10 |
Fast hashing search problem |
9.5.12 |
Faster Polynomial |