page620.html

wqeqwvrw rkjqhwrjwq jkhrjqwhrwq jkhrwq

</DL><DT>first-fit allocation strategy<DD><A NAME="tex2html814" HREF="page424.html#30651" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page424.html#30651">Acquiring an Area</A>, <A NAME="tex2html837" HREF="page438.html#32135" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page438.html#32135">Exercises</A>
<DT>floor function<DD><A NAME="tex2html21" HREF="page44.html#602" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page44.html#602">About Harmonic Numbers</A>
<DT>Floyd's algorithm<DD><A NAME="tex2html1123" HREF="page571.html#52110" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page571.html#52110">Floyd's Algorithm</A>
<DT>forest<DD><A NAME="tex2html683" HREF="page370.html#26597" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page370.html#26597">Binomial Queues</A>, <A NAME="tex2html696" HREF="page372.html#27181" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page372.html#27181">Binomial Queues</A>, <A NAME="tex2html769" HREF="page406.html#28705" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page406.html#28705">Implementing a Partition using </A>
<DT>formal parameter<DD><A NAME="tex2html1187" HREF="page592.html#57164" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page592.html#57164">Pass By Value</A>
<DT>Fortran<DD><A NAME="tex2html171" HREF="page108.html#4370" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page108.html#4370">Abstract Data Types</A>
<DT>foundational data structure<DD><A NAME="tex2html107" HREF="page79.html#2442" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page79.html#2442">Foundational Data Structures</A>
<DT>free<DD><A NAME="tex2html809" HREF="page421.html#30552" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page421.html#30552">Singly Linked Free Storage</A>
<DT>free list<DD><A NAME="tex2html810" HREF="page421.html#30554" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page421.html#30554">Singly Linked Free Storage</A>
<DT>free store<DD><A NAME="tex2html114" HREF="page82.html#2690" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page82.html#2690">Array Constructor</A>
<DT><code>frexp</code><DD><A NAME="tex2html407" HREF="page217.html#11408" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page217.html#11408">Floating-Point Keys</A>
<DT>friend<DD><A NAME="tex2html164" HREF="page104.html#4177" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page104.html#4177">Canonical Matrix Multiplication</A>, <A NAME="tex2html263" HREF="page137.html#5936" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page137.html#5936">Iterator</A>
<DT>fully connected graph<DD><A NAME="tex2html1163" HREF="javascript:if(confirm('http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page584.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/page584.html#56290'" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page584.html#56290">Exercises</A>
<DT>Gauss, Karl Friedrich<DD><A NAME="tex2html688" HREF="page371.html#27135" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page371.html#27135">Binomial Trees</A>
<DT>generalization<DD><A NAME="tex2html312" HREF="page158.html#8435" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page158.html#8435">Deques</A>
<DT>generalized Fibonacci numbers<DD><A NAME="tex2html882" HREF="page466.html#33284" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page466.html#33284">Example-Generalized Fibonacci Numbers</A>
<DT>generic<DD><A NAME="tex2html1228" HREF="page615.html#57970" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page615.html#57970">Templates</A>
<DT>geometric series<DD><A NAME="tex2html40" HREF="page51.html#944" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page51.html#944">About Geometric Series Summation</A>
<DT>geometric series summation<DD><A NAME="tex2html32" HREF="page48.html#810" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page48.html#810">An Example-Geometric Series Summation</A>, <A NAME="tex2html38" HREF="page50.html#898" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page50.html#898">Example-Geometric Series Summation Again</A>, <A NAME="tex2html41" HREF="page51.html#948" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page51.html#948">About Geometric Series Summation</A>, <A NAME="tex2html48" HREF="page53.html#1077" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page53.html#1077">Example-Geometric Series Summation Yet </A>
<DT>golden ratio<DD><A NAME="tex2html398" HREF="page214.html#11252" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page214.html#11252">Fibonacci Hashing</A>
<DT>graph<DD><DL><DT>connectedness<DD><A NAME="tex2html1101" HREF="page561.html#50830" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page561.html#50830">Connectedness of an Undirected </A>
<DT>dense<DD><A NAME="tex2html1068" HREF="page534.html#49396" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page534.html#49396">Sparse vs. Dense Graphs</A>
<DT>directed<DD><A NAME="tex2html1025" HREF="page525.html#48363" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page525.html#48363">Directed Graphs</A>
<DT>directed acyclic<DD><A NAME="tex2html1050" HREF="page528.html#48870" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page528.html#48870">Directed Acyclic Graphs</A>
<DT>edge-weighted<DD><A NAME="tex2html1079" HREF="page546.html#49939" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page546.html#49939">Edge-Weighted and Vertex-Weighted Graphs</A>
<DT>labeled<DD><A NAME="tex2html1059" HREF="page531.html#49167" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page531.html#49167">Labeled Graphs</A>
<DT>sparse<DD><A NAME="tex2html1066" HREF="page534.html#49388" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page534.html#49388">Sparse vs. Dense Graphs</A>
<DT>traversal<DD><A NAME="tex2html1084" HREF="page550.html#50040" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page550.html#50040">Graph Traversals</A>
<DT>undirected<DD><A NAME="tex2html1056" HREF="page529.html#49019" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page529.html#49019">Undirected Graphs</A>
<DT>vertex-weighted<DD><A NAME="tex2html1081" HREF="page546.html#49943" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page546.html#49943">Edge-Weighted and Vertex-Weighted Graphs</A>
</DL><DT>graph theory<DD><A NAME="tex2html1022" HREF="page523.html#48355" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page523.html#48355">Graphs  and Graph Algorithms</A>
<DT>harmonic number<DD><A NAME="tex2html18" HREF="page43.html#574" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page43.html#574">Average Running Times</A>, <A NAME="tex2html24" HREF="page44.html#590" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page44.html#590">About Harmonic Numbers</A>, <A NAME="tex2html458" HREF="page246.html#14204" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page246.html#14204">Average Case Analysis</A>, <A NAME="tex2html575" HREF="page308.html#19219" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page308.html#19219">Solving The Recurrence-Telescoping</A>, <A NAME="tex2html970" HREF="page499.html#38016" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page499.html#38016">Average Running Time</A>
<DT>harmonic series<DD><A NAME="tex2html23" HREF="page44.html#584" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page44.html#584">About Harmonic Numbers</A>
<DT>hash function<DD><A NAME="tex2html379" HREF="page206.html#11188" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page206.html#11188">Keys and Hash Functions</A>, <A NAME="tex2html380" HREF="page206.html#11191" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page206.html#11191">Keys and Hash Functions</A>
<DT>hash table<DD><A NAME="tex2html424" HREF="page222.html#11641" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page222.html#11641">Hash Tables</A>
<DT>hashing<DD><DL><DT>division method<DD><A NAME="tex2html384" HREF="page211.html#11206" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page211.html#11206">Division Method</A>
<DT>Fibonacci method<DD><A NAME="tex2html397" HREF="page214.html#11250" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page214.html#11250">Fibonacci Hashing</A>
<DT>middle-square method<DD><A NAME="tex2html387" HREF="page212.html#11216" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page212.html#11216">Middle Square Method</A>
<DT>multiplication method<DD><A NAME="tex2html392" HREF="page213.html#11234" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page213.html#11234">Multiplication Method</A>
</DL><DT>head<DD><A NAME="tex2html133" HREF="page88.html#3070" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page88.html#3070">Singly-Linked Lists</A>
<DT>heap<DD><A NAME="tex2html115" HREF="page82.html#2692" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page82.html#2692">Array Constructor</A>, <A NAME="tex2html655" HREF="page353.html#24018" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page353.html#24018">Basics</A>, <A NAME="tex2html803" HREF="page420.html#30451" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page420.html#30451">The Heap</A>
<DT>heapify<DD><A NAME="tex2html985" HREF="page504.html#39268" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page504.html#39268">Sorting with a Heap</A>
<DT>heapsort<DD><A NAME="tex2html983" HREF="page504.html#39263" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page504.html#39263">Sorting with a Heap</A>
<DT>height<DD><DL><DT>of a node in a tree<DD><A NAME="tex2html473" HREF="page253.html#15108" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page253.html#15108">More Terminology</A>
<DT>of a tree<DD><A NAME="tex2html474" HREF="page253.html#15110" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page253.html#15110">More Terminology</A>
</DL><DT>heuristic<DD><A NAME="tex2html869" HREF="page453.html#32815" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page453.html#32815">Depth-FirstBranch-and-Bound Solver</A>
<DT>hierarchy<DD><A NAME="tex2html462" HREF="page250.html#14729" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page250.html#14729">Trees</A>
<DT>Horner's rule<DD><A NAME="tex2html8" HREF="page39.html#390" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page39.html#390">Another Example-Horner's Rule</A>, <A NAME="tex2html39" HREF="page50.html#906" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page50.html#906">Example-Geometric Series Summation Again</A>, <A NAME="tex2html413" HREF="page218.html#11456" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page218.html#11456">Character String Keys</A>
<DT>idempotent<DD><A NAME="tex2html210" HREF="page111.html#4545" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page111.html#4545">Objects</A>
<DT>in-degree<DD><A NAME="tex2html1039" HREF="page526.html#48816" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page526.html#48816">Terminology</A>, <A NAME="tex2html1096" HREF="page557.html#50799" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page557.html#50799">Topological Sort</A>
<DT>in-place sorting<DD><A NAME="tex2html948" HREF="page487.html#34649" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page487.html#34649">Insertion Sorting</A>, <A NAME="tex2html977" HREF="page501.html#38071" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page501.html#38071">Selection Sorting</A>
<DT>incident<DD><A NAME="tex2html1037" HREF="page526.html#48813" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page526.html#48813">Terminology</A>
<DT>increment<DD><A NAME="tex2html900" HREF="page472.html#33952" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page472.html#33952">Generating Random Numbers</A>
<DT>indirect containment<DD><A NAME="tex2html236" HREF="page123.html#5160" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page123.html#5160">Direct vs. Indirect Containment</A>, <A NAME="tex2html538" HREF="page276.html#16440" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page276.html#16440">General Trees</A>
<DT>infix<DD><A NAME="tex2html271" HREF="page144.html#6187" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page144.html#6187">Applications</A>
<DT>infix notation<DD><A NAME="tex2html520" HREF="page263.html#16076" tppabs="http://dictator.uwaterloo.ca/Br