page620.html

wqeqwvrw rkjqhwrjwq jkhrjqwhrwq jkhrwq

<DT>bag<DD><A NAME="tex2html247" HREF="page129.html#5411" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page129.html#5411">Projects</A>, <A NAME="tex2html752" HREF="page397.html#28464" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page397.html#28464">Multisets</A>
<DT>balance condition<DD><A NAME="tex2html594" HREF="page320.html#19966" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page320.html#19966">AVL Search Trees</A>, <A NAME="tex2html633" HREF="page340.html#21682" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page340.html#21682">B-Trees</A>
<DL><DT>AVL<DD><A NAME="tex2html597" HREF="page320.html#19975" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page320.html#19975">AVL Search Trees</A>
</DL><DT>base class<DD><A NAME="tex2html204" HREF="page110.html#4474" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page110.html#4474">Class Hierarchy</A>, <A NAME="tex2html1207" HREF="page607.html#57416" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page607.html#57416">Derivation and Inheritance</A>
<DT>best-fit allocation strategy<DD><A NAME="tex2html815" HREF="page424.html#30653" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page424.html#30653">Acquiring an Area</A>, <A NAME="tex2html839" HREF="page438.html#32137" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page438.html#32137">Exercises</A>
<DT>big oh<DD><A NAME="tex2html51" HREF="page57.html#1324" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page57.html#1324">An Asymptotic Upper Bound-Big </A>
<DL><DT>tightness<DD><A NAME="tex2html59" HREF="page63.html#1584" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page63.html#1584">Tight Big Oh Bounds</A>, <A NAME="tex2html75" HREF="page69.html#1836" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page69.html#1836">More Notation-Theta and Little </A>
<DT>tightness<DD><A NAME="tex2html59" HREF="page63.html#1584" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page63.html#1584">Tight Big Oh Bounds</A>, <A NAME="tex2html75" HREF="page69.html#1836" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page69.html#1836">More Notation-Theta and Little </A>
<DT>transitive property<DD><A NAME="tex2html54" HREF="page60.html#1473" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page60.html#1473">Properties of Big Oh</A>
</DL><DT>binary digit<DD><A NAME="tex2html693" HREF="page372.html#27176" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page372.html#27176">Binomial Queues</A>
<DT>binary heap<DD><A NAME="tex2html982" HREF="page504.html#39261" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page504.html#39261">Sorting with a Heap</A>
<DT>binary operator<DD><A NAME="tex2html272" HREF="page144.html#6189" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page144.html#6189">Applications</A>
<DT>binary search<DD><A NAME="tex2html368" HREF="page191.html#10752" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page191.html#10752">Locating Items in an </A>, <A NAME="tex2html872" HREF="page456.html#32856" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page456.html#32856">Example-Binary Search</A>
<DT>binary search tree<DD><A NAME="tex2html567" HREF="page302.html#18752" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page302.html#18752">Binary Search Trees</A>, <A NAME="tex2html568" HREF="page302.html#18757" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page302.html#18757">Binary Search Trees</A>
<DT>binary tree<DD><A NAME="tex2html498" HREF="page256.html#15546" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page256.html#15546">Binary Trees</A>, <A NAME="tex2html499" HREF="page256.html#15551" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page256.html#15551">Binary Trees</A>
<DL><DT>complete<DD><A NAME="tex2html659" HREF="page355.html#24041" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page355.html#24041">Complete Trees</A>
</DL><DT>binding<DD><A NAME="tex2html189" HREF="page108.html#4415" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page108.html#4415">Abstract Data Types</A>, <A NAME="tex2html1177" HREF="javascript:if(confirm('http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page587.html  \n\nThis file was not retrieved by Teleport Pro, because the server reports that an error occurred that prevented retrieval.  \n\nDo you want to open it from the server?'))window.location='http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page587.html#56960'" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page587.html#56960">VariablesPointers and References</A>
<DT>binomial<DD><A NAME="tex2html689" HREF="page371.html#27114" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page371.html#27114">Binomial Trees</A>
<DT>binomial coefficient<DD><A NAME="tex2html690" HREF="page371.html#27128" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page371.html#27128">Binomial Trees</A>
<DT>bit<DD><A NAME="tex2html695" HREF="page372.html#27179" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page372.html#27179">Binomial Queues</A>
<DT><tt>bitsizeof</tt><DD>textbf
<DT>bitwise exclusive-or<DD><A NAME="tex2html829" HREF="page431.html#31672" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page431.html#31672">Buddy System for Storage </A>
<DT>Boolean<DD><DL><DT>and<DD><A NAME="tex2html738" HREF="page392.html#28336" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page392.html#28336">UnionIntersection and Difference</A>
<DT>or<DD><A NAME="tex2html736" HREF="page392.html#28332" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page392.html#28332">UnionIntersection and Difference</A>
</DL><DT>bound<DD><A NAME="tex2html190" HREF="page108.html#4417" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page108.html#4417">Abstract Data Types</A>
<DT>branch-and-bound<DD><A NAME="tex2html866" HREF="page452.html#32794" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page452.html#32794">Branch-and-Bound Solvers</A>
<DT>breadth-first spanning tree<DD><A NAME="tex2html1130" HREF="javascript:if(confirm('http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page575.html  \n\nThis file was not retrieved by Teleport Pro, because the server reports that an error occurred that prevented retrieval.  \n\nDo you want to open it from the server?'))window.location='http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page575.html#52598'" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page575.html#52598">Constructing Spanning Trees</A>
<DT>breadth-first traversal<DD><A NAME="tex2html294" HREF="page156.html#7387" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page156.html#7387">Applications</A>, <A NAME="tex2html302" HREF="page156.html#7690" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page156.html#7690">Applications</A>, <A NAME="tex2html515" HREF="page261.html#15893" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page261.html#15893">Breadth-First Traversal</A>, <A NAME="tex2html853" HREF="page447.html#32615" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page447.html#32615">Example-Balancing Scales</A>, <A NAME="tex2html1090" HREF="page554.html#50335" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page554.html#50335">Breadth-First Traversal</A>
<DT>brute-force algorithms<DD><A NAME="tex2html841" HREF="page441.html#32296" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page441.html#32296">Brute-Force and Greedy Algorithms</A>
<DT>bubble sort<DD><A NAME="tex2html960" HREF="page493.html#35375" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page493.html#35375">Bubble Sort</A>
<DT>bucket sort<DD><A NAME="tex2html100" HREF="page74.html#2215" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page74.html#2215">Example-Bucket Sort</A>
<DT>buckets<DD><A NAME="tex2html102" HREF="page74.html#2226" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page74.html#2226">Example-Bucket Sort</A>
<DT>buddy system<DD><A NAME="tex2html827" HREF="page431.html#31615" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page431.html#31615">Buddy System for Storage </A>
<DT>built-in types<DD><A NAME="tex2html1191" HREF="page596.html#57210" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page596.html#57210">Objects and Classes</A>
<DT>C programming language<DD><A NAME="tex2html173" HREF="page108.html#4372" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page108.html#4372">Abstract Data Types</A>
<DT>C++ programming language<DD><A NAME="tex2html174" HREF="page108.html#4373" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page108.html#4373">Abstract Data Types</A>
<DT>carry<DD><A NAME="tex2html705" HREF="page379.html#27579" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page379.html#27579">Merging Binomial Queues</A>
<DT>cast operator<DD><A NAME="tex2html1222" HREF="page614.html#57946" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page614.html#57946">Run-Time Type Information and </A>
<DT>ceiling function<DD><A NAME="tex2html22" HREF="page44.html#604" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page44.html#604">About Harmonic Numbers</A>
<DT>central limit theorem<DD><A NAME="tex2html928" HREF="page481.html#34414" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page481.html#34414">Exercises</A>
<DT>chained scatter table<DD><A NAME="tex2html434" HREF="page230.html#12036" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page230.html#12036">Chained Scatter Table</A>
<DT>child<DD><A NAME="tex2html298" HREF="page156.html#7396" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page156.html#7396">Applications</A>, <A NAME="tex2html468" HREF="page252.html#15081" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page252.html#15081">Terminology</A>
<DT>circular list<DD><A NAME="tex2html137" HREF="page88.html#3083" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page88.html#3083">Singly-Linked Lists</A>, <A NAME="tex2html322" HREF="page163.html#8926" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page163.html#8926">Doubly-Linked and Circular Lists</A>
<DT>clock frequency<DD><A NAME="tex2html29" HREF="page47.html#804" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page47.html#804">A Simplified Model of </A>
<DT>clock period<DD><A NAME="tex2html28" HREF="page47.html#803" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page47.html#803">A Simplified Model of </A>
<DT>coalesce<DD><A NAME="tex2html435" HREF="page230.html#12425" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page230.html#12425">Chained Scatter Table</A>
<DT>cocktail shaker sort<DD><A NAME="tex2html1020" HREF="page521.html#47743" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page521.html#47743">Exercises</A>
<DT>coefficient<DD><DL><DT>binomial<DD><A NAME="tex2html691" HREF="page371.html#27129" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page371.html#27129">Binomial Trees</A>
</DL><DT>coercion<DD><A NAME="tex2html166" HREF="page104.html#4182" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page104.html#4182">Canonical Matrix Multiplication</A>
<DT>collapsing find<DD><A NAME="tex2html778" HREF="page410.html#29829" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page410.html#29829">Collapsing Find</A>
<DT>column-major order<DD><A NAME="tex2html168" HREF="page105.html#4237" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page105.html#4237">Exercises</A>
<DT>commensurate<DD><DL><DT>elements<DD><A NAME="tex2html360" HREF="page188.html#10465" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page188.html#10465">Sorted Lists</A>, <A NAME="tex2html930" HREF="page484.html#34523" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page484.html#34523">Basics</A>
<DT>elements<DD><A NAME="tex2html360" HREF="page188.html#10465" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page188.html#10465">Sorted Lists</A>, <A NAME="tex2html930" HREF="page484.html#34523" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page484.html#34523">Basics</A>
<DT>functions<DD><A NAME="tex2html61" HREF="page64.html#1617" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page64.html#1617">More Big Oh Fallacies </A>, <A NAME="tex2html62" HREF="page64.html#1612" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page64.html#1612">More Big Oh Fallacies </A>
<DT>functions<DD><A NAME="tex2html61" HREF="page64.html#1617" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page64.html#1617">More Big Oh Fallacies </A>, <A NAME="tex2html62" HREF="page64.html#1612" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page64.html#1612">More Big Oh Fallacies </A>
</DL><DT>complement<DD><A NAME="tex2html794" HREF="page414.html#30125" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page414.html#30125">Exercises</A>