Algorithms Design
|
Books
|
WWW
|
Index
Index
A
B
C
D
E
F
G
H
I
K
L
M
N
O
P
Q
R
S
T
U
V
W
\0
, null byte
\n
, newline
\n
, at end of file
%c
%s
n-and-a-half loop
&x
*p
x++
++x
->
,
A
additional parameter
address
address arithmetic
address arithmetic
address of a list
anagram
API
API
argc
,
argv
array
array
ASCII alphabet
ASCII character
ASCII file
ASCII string
ASCII table
atoi
B
backtracking
balanced tree
binary file
binary notation
binary search
binary tree
bit
boolean
Boyer-Moore algorithm
breadth-first search
byte
C
C99
C99
call by reference
call by value
cast
ceiling
character
character
character chain
child of a node
coding scheme
coding scheme
comma operator
command line arguments
compilation
constants
correct algorithm
correctness of algorithm
ctype.h
CWEB
CWEB
D
dangling pointer
data type
decoding
UTF-8
decreasing
#define
depth of node
depth of recursion
depth-first search
derangement
diacritics in code
digital sort
Dijkstra
documentation
dynamic memory allocation
E
efficient algorithm
elegant algorithm
encoding scheme
encoding scheme
enumeration
EOF
executable file
execution stack
exhaustive search
exit
EXIT_FAILURE
EXIT_SUCCESS
F
fgetc
fgets
Fibonacci
FIFO
file
FILE
floor
font, monospaced
fputc
fputs
function: maths
vs
C
G
gcc
gdb
getc
global variable
H
hash function
hash table
hashing
headed linked list
header file
header file
heap
heapsort
height of tree
hexadecimal
Hoare
how
vs
what
I
I/O
include
increasing
indentation
inorder traversal
input/output
insertion algorithm
Insertionsort
instance of a problem
INT_MAX
,
INT_MIN
integer division
interface file
interface file
invariant of iterative process
invariant (example)
ISO-8859-1
ISO-LATIN-1
K
Knuth
L
largest (the
vs
a)
layout
leaf of tree
leak (memory)
least distance
left-right-root
left-root-right
lexicographic order
lexicographic order
lexicographic
lg (n)
LIFO
limits.h
linear search
linked list
locale
log
n
long int
M
macro
main
make
Makefile
malloc
math.h
matrix
maximal (the
vs
a)
memory leak
mergesort
module (of a program)
monospaced font
N
n/2
in C
negative
NULL
O
octal
online
overflow
overflow
overflow
overflow
overflow
overflow
P
parent of a node
partition
partition
passing argument by value
permutation
pointer
pointer declaration
pointer, dangling
Polish notation
positive
postorder traversal
precedence between operators
precompiler
prefix
preorder traversal
preprocessing
preprocessor
priority queue
priority queue
problem of the 8 queens
problem of the knight tour
proof of correctness of algorithm
putc
putchar
Q
queue
quicksort
R
radix sort
rand
random number
random permutation
real number
realloc
reallocation
reallocation
reallocation
record
recursion
recursion stack
redirecting I/O
reference
reference
reference (call by)
resizing
resizing
resizing
resizing
root of tree
root-left-right
S
search tree
seed (random numbers)
segment
segmentation fault
selection algorithm
Selectionsort
semaphore variable
sentinel
sequence
sequence of bytes
sequential search
short-circuit evaluation
shortest distance
side effect
signaling variable
size_t
size_t
sizeof
sizeof
software specification
solution
sorting
source file
space
sscanf
stability (sorting)
stable sort
stack
static
std=c99
std=c99
stdin
stdio.h
stdlib.h
stdout
strcoll
strictly decreasing
strictly increasing
strictly negative
strictly positive
string
string matching
string searching
string.h
strtol
struct
subarray
subsequence
subsequence
subset sum
substring searching
suffix
suffix
T
tab
tail recursion
text file
time.h
tree searching
trees
typedef
two's complement
U
Unicode
UTF-8
UTF-8
UTF-8
V
valgrind
value of boolean expression
value of expression
variable-length array
variable-length array
W
what
vs
how
white-space
white-space
Williams
word