fixed typo; version 6.1.6

Author: ChrisMayfield

thinkjava.tex

@@ -6,7 +6,7 @@
 \newcommand{\thetitle}{Think Java}
 \newcommand{\thesubtitle}{How to Think Like a Computer Scientist}
 \newcommand{\theauthors}{Allen B. Downey and Chris Mayfield}
-\newcommand{\theversion}{6.1.5}
+\newcommand{\theversion}{6.1.6}
 
 %%%% Both LATEX and PLASTEX
 
@@ -383,7 +383,7 @@ \section*{Contributors over the years}
 We are especially grateful to our technical reviewers: Blythe Samuels, David Wisneski, and Stephen Rose.
 They found errors, made many great suggestions, and helped make the book much better.
 
-Additional contributors who found one or more typos: Stijn Debrouwere, Guy Driesen, Andai Velican, Chris Kuszmaul, Daniel Kurikesu, Josh Donath, Rens Findhammer, Elisa Abedrapo, Yousef BaAfif, Bruce Hill, Matt Underwood, Isaac Sultan, Dan Rice, Robert Beard, Daniel Pierce, Michael Giftthaler, Chris Fox, Min Zeng, and Markus Geuss.
+Additional contributors who found one or more typos: Stijn Debrouwere, Guy Driesen, Andai Velican, Chris Kuszmaul, Daniel Kurikesu, Josh Donath, Rens Findhammer, Elisa Abedrapo, Yousef BaAfif, Bruce Hill, Matt Underwood, Isaac Sultan, Dan Rice, Robert Beard, Daniel Pierce, Michael Giftthaler, Chris Fox, Min Zeng, Markus Geuss, and Waldo Ribeiro.
 
 If you have additional comments or ideas about the text, please send them to: \href{mailto:feedback@greenteapress.com}{\tt feedback@greenteapress.com}.
 
@@ -9863,7 +9863,7 @@ \section{Vocabulary}
 An algorithm that searches array elements, one by one, until a target value is found.
 
 \term{binary search}
-An algorithm that searches a sorted array by starting in the middle, comparing and element to the target, and eliminating half of the remaining elements.
+An algorithm that searches a sorted array by starting in the middle, comparing an element to the target, and eliminating half of the remaining elements.
 
 \end{description}