This project include the whole implementations of this Book's Algorithms and my solutions to part of Exercises in this Book .
本项目包含了书上的所有经典算法的实现和我对书上课后习题的解答
(Exercise 1.1.1c, 1.1.16, 1.1.18, 1.1.19, 1.1.20, 1.1.22, 1.1.25, 1.1.29, 1.1.34, 1.1.36)
-
Euclid's algorithm: Computer the GCD(Greatest Common Divisor) of two nonzero integers.
(Exercise 1.2.6, 1.2.7, 1.2.10, 1.2.16, 1.2.17)
- null
(Exercise 1.3.3, 1.3.4, 1.3.9, 1.3.10, 1.3.11, 1.3.31, 1.3.32, 1.3.33, 1.3.37, 1.3.49, 1.3.50)
- Bag(imeplemented by Single Linked List)
- Stack(implemented by resizing-capacity array)
- Queue(imeplemented by Single Linked List)
- DoubleLinkedList(implemented by Double Linked List)
(Exercise 1.4.1 1.4.3 1.4.5 1.4.6 1.4.9 1.4.11 1.4.15 1.4.16 1.4.17 1.4.19 1.4.20 1.4.22 1.4.23 1.4.24 1.4.25 1.4.32 1.4.41)
- null
(Exercise 1.5.12, 1.5.13, 1.5.16, 1.5.17)
(Exercise 2.1.3 2.1.4 2.1.11 2.1.13 2.1.14 2.1.15 2.1.16 2.1.17 2.1.18 2.1.20 2.1.24 2.1.25 2.1.26 2.1.29)
- SelectionSort
- InsertionSort
- ShellSort
- ArrayShuffle (by Donald Knuth)
- ConvexHull(凸包问题)
(Exercise 2.2.4 2.2.8 2.2.9 2.2.10 2.2.11 2.2.16 2.2.17 2.2.19 2.2.20 2.2.21 2.2.23 2.2.25 2.2.29)
TODO Ex 2.2.12 Ex 2.2.18
(Exercise 2.3.6 2.3.8 2.3.11 2.3.13 2.3.16 2.3.17 2.3.18 2.3.19 2.3.20 2.3.21 2.3.22 2.3.23 2.3.24 2.3.25)
TODO Ex 2.3.10 Ex 2.3.14 Ex 2.3.15