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.
go test -tags all ./...go test -v -bench=. -tags benchmark ./...| Problem | Description |
|---|---|
| 1.6.2 | Bit Vectors |
| 1.6.3; 1.6.7 | Bitmap Sort |
| 1.6.4 | Generate k unique random integers |
| 1.6.9 | Sparse Vector |
| 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 |
|---|---|
| 3.7.2 | Linear recurrence |
| 3.7.3 | Banner |
| 3.7.4 | Date |
| 3.7.5 | Hyphenations |
| 3.7.6 | Form-letter generator |
| 3.7.8 | Seven Segments |
| Problem | Description |
|---|---|
| 4.6.2; 4.6.8; 4.6.10 | Fast Binary Search |
| 4.6.5 | Hailstone Number |
| 4.6.6 | Coffee Can Problem |
| 4.6.7 | Two lines that bracket the point |
| 4.6.9 | Power Verification |
| 4.6.11 | Binary Search Specific Declaration |
| 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 |