raster pixel display, 143
real-world problems, modeling with graphs, 61
recruiters
drawing attention away from negative aspects, 11
high-pressure tactics, 12
role of, 11–12
signing you at lowest possible salary, 12
territory of some, 12
Rectangle Overlap problem, 149–153
Rectangle subclass in Shape, 123–124
rectangles, conditions for not overlapping, 152–153
recursion
implementing a traversal, 60
subtree property as conducive to, 58
understanding, 89–92
using, 48
using stack data structure, 63
recursion problems, 92–105
recursive algorithms
implementing without using recursive calls, 92
replacing with iterative algorithms, 63
recursive calls, eliminating the need for, 92
recursive cases, 89
recursive definition of a preorder traversal, 62
recursive implementation of a binary search, 93
recursive preorder traversal, emulating
iteratively, 64
recursive routines, 89
recursive solution, code for, 49
red-black tree, 58
reference counting in garbage collection, 188–189
references
explicitly disambiguating, 129
for headhunters, 8
not mentioning on a resume, 209
storing in Java or C#, 26
referential integrity, 132
relational databases, 131–132
relevant information, including on a resume, 209
remove function, writing, 36–39
remove method, synchronizing with add, 115–116
Remove Specified Characters problem, 76–79
resumes
checking for viruses, 9
described, 203
examples of good, 218–221
examples of technical, 203–218
formatting, 208
keeping short, 206–207
reviewing prior to interviews, 185
sending as plain text in the body of the e-mail, 9
submitting through the Internet, 8–9
reverse string function, designing, 82
Reverse Words problem, 79–83
right child in a binary tree, 55
rolling back transactions, 136
root node
as an ancestor to all nodes in a BST, 65
of a heap, 58
rounding
in graphics algorithms, 143
in a line-drawing algorithm, 144
routines
indicating success or failure of, 32
recursive, 89
rows in tables, 131
Rubik’s Cube, 176
rules of coding questions, 16
run-time analysis
of algorithms, 20
fastest-possible running time for any, 22