forked from liuxinyu95/AlgoXY
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain-en.tex
111 lines (77 loc) · 2.68 KB
/
main-en.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
%\documentclass{article}
\documentclass[a4paper,twoside]{book} %this has problems
\input{common-en.tex}
\setcounter{page}{1}
% ==================== Book flag==========================
\global\let\wholebook=\relax %without relax, we build article, esle book
\graphicspath{
{img/}
{others/preface/}
{datastruct/tree/binary-search-tree/}
{sorting/insertion-sort/}
{datastruct/tree/red-black-tree/}
{datastruct/tree/AVL-tree/}
{datastruct/tree/trie/}
{datastruct/tree/suffix-tree/}
{datastruct/tree/B-tree/}
{datastruct/heap/binary-heap/}
{sorting/select-sort/}
{sorting/dc-sort/}
{datastruct/heap/other-heaps/}
{datastruct/elementary/queue/}
{datastruct/elementary/sequence/}
{others/appendix/list/}
}
\makeindex
\begin{document}
% set PDF properties
\hypersetup{pdftitle={algoxy},%
pdfauthor={[email protected]},%
pdfsubject={Computer Science},%
pdfkeywords={Algorithm, Programming}}
% ================================================================
% COVER PAGE
% ================================================================
\title{{\bf \Huge AlgoXY} elementary algorithms
%\scalebox{1.2}{\includegraphics{images/clouds.eps}}
}
\author{Larry LIU Xinyu
\thanks{{\bfseries Larry LIU Xinyu } \newline
Draft version 2012, Beijing \newline
Email: [email protected] \newline
}}
\maketitle
% ================================================================
% Content
% ================================================================
%\newpage
\tableofcontents
\newpage
%\part{Introduction}
\input{others/preface/preface-en.tex}
\part{Trees}
\input{datastruct/tree/binary-search-tree/bstree-en.tex}
\input{sorting/insertion-sort/isort-en.tex}
\input{datastruct/tree/red-black-tree/rbtree-en.tex}
\input{datastruct/tree/AVL-tree/avltree-en.tex}
\input{datastruct/tree/trie/trie-en.tex}
\input{datastruct/tree/suffix-tree/stree-en.tex}
\input{datastruct/tree/B-tree/btree-en.tex}
\part{Heaps}
\input{datastruct/heap/binary-heap/bheap-en.tex}
\input{sorting/select-sort/ssort-en.tex}
\input{datastruct/heap/other-heaps/kheap-en.tex}
\part{Queues and Sequences}
\input{datastruct/elementary/queue/queue-en.tex}
\input{datastruct/elementary/sequence/sequence-en.tex}
\part{Sorting and Searching}
\input{sorting/dc-sort/dcsort-en.tex}
\part{Appendix}
\appendix
\appendixpage
\noappendicestocpagenum
\addappheadtotoc
\input{others/appendix/list/list-en.tex}
\input{fdl-1.3.tex}
\printindex
\end{document}