page620.html

wqeqwvrw rkjqhwrjwq jkhrjqwhrwq jkhrwq

<DT>distribution sorting<DD><A NAME="tex2html1004" HREF="page515.html#45207" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page515.html#45207">Distribution Sorting</A>
<DT>distribution sorts<DD><A NAME="tex2html944" HREF="page486.html#34607" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page486.html#34607">Sorter Class Hierarchy</A>
<DT>divide and conquer<DD><A NAME="tex2html870" HREF="page455.html#32850" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page455.html#32850">Top-Down Algorithms: Divide-and-Conquer</A>
<DT>division method of hashing<DD><A NAME="tex2html383" HREF="page211.html#11205" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page211.html#11205">Division Method</A>
<DT>domain error<code>domain_error</code><DD><A NAME="tex2html146" HREF="page94.html#3616" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page94.html#3616"><tt>First</tt> and <tt>Last</tt> Functions</A>
<DT>double construction<DD><A NAME="tex2html799" HREF="page418.html#30389" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page418.html#30389">C++ Magic</A>
<DT>double hashing<DD><A NAME="tex2html449" HREF="page240.html#13888" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page240.html#13888">Double Hashing</A>
<DT>double rotation<DD><A NAME="tex2html613" HREF="page327.html#21041" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page327.html#21041">Double Rotations</A>
<DT>double-ended queue<DD><A NAME="tex2html309" HREF="page158.html#8022" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page158.html#8022">Deques</A>
<DT>doubly-linked list<DD><A NAME="tex2html321" HREF="page163.html#8600" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page163.html#8600">Doubly-Linked and Circular Lists</A>
<DT>dual<DD><A NAME="tex2html1151" HREF="javascript:if(confirm('http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page582.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/page582.html#55357'" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page582.html#55357">Application: Critical Path Analysis</A>
<DT>dynamic binding<DD><A NAME="tex2html192" HREF="page108.html#4423" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page108.html#4423">Abstract Data Types</A>
<DT><code>dynamic_cast</code><DD><A NAME="tex2html220" HREF="page116.html#4771" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page116.html#4771">Implementation</A>
<DT><code>dynamic_cast</code><DD><A NAME="tex2html245" HREF="page126.html#5295" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page126.html#5295">Implementation</A>
<DT>dynamic programming<DD><A NAME="tex2html880" HREF="page465.html#33281" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page465.html#33281">Bottom-Up Algorithms: Dynamic<BR> Programming</A>
<DT><code>dynamic_cast</code><DD><A NAME="tex2html1224" HREF="page614.html#57957" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page614.html#57957">Run-Time Type Information and </A>
<DT>earliest event time<DD><A NAME="tex2html1153" HREF="javascript:if(confirm('http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page582.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/page582.html#55586'" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page582.html#55586">Application: Critical Path Analysis</A>
<DT>edge<DD><A NAME="tex2html296" HREF="page156.html#7392" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page156.html#7392">Applications</A>, <A NAME="tex2html1029" HREF="page526.html#48795" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page526.html#48795">Terminology</A>
<DL><DT>emanate<DD><A NAME="tex2html1034" HREF="page526.html#48808" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page526.html#48808">Terminology</A>
<DT>incident<DD><A NAME="tex2html1038" HREF="page526.html#48814" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page526.html#48814">Terminology</A>
</DL><DT>edge-weighted graph<DD><A NAME="tex2html1078" HREF="page546.html#49938" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page546.html#49938">Edge-Weighted and Vertex-Weighted Graphs</A>
<DT>element<DD><A NAME="tex2html717" HREF="page387.html#28093" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page387.html#28093">SetsMultisets and Partitions</A>
<DT>emanate<DD><A NAME="tex2html1033" HREF="page526.html#48807" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page526.html#48807">Terminology</A>
<DT>enumeration<DD><A NAME="tex2html249" HREF="page129.html#5427" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page129.html#5427">Projects</A>
<DT>equivalence classes<DD><A NAME="tex2html791" HREF="page413.html#30069" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page413.html#30069">Applications</A>
<DT>equivalence of trees<DD><A NAME="tex2html553" HREF="page294.html#17281" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page294.html#17281">Comparing Trees</A>
<DT>equivalence relation<DD><A NAME="tex2html786" HREF="page413.html#30057" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page413.html#30057">Applications</A>, <A NAME="tex2html1143" HREF="javascript:if(confirm('http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page579.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/page579.html#53707'" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page579.html#53707">Kruskal's Algorithm</A>
<DT>Euler's constant<DD><A NAME="tex2html26" HREF="page44.html#712" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page44.html#712">About Harmonic Numbers</A>, <A NAME="tex2html576" HREF="page308.html#19222" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page308.html#19222">Solving The Recurrence-Telescoping</A>, <A NAME="tex2html971" HREF="page499.html#38020" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page499.html#38020">Average Running Time</A>
<DT>Euler, Leonhard<DD><A NAME="tex2html687" HREF="page371.html#27134" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page371.html#27134">Binomial Trees</A>
<DT>Eulerian walk<DD><A NAME="tex2html1166" 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#56304'" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page584.html#56304">Exercises</A>
<DT>evaluation stack<DD><A NAME="tex2html524" HREF="page265.html#16111" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page265.html#16111">Postfix Notation</A>
<DT>event-node graph<DD><A NAME="tex2html1152" HREF="javascript:if(confirm('http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page582.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/page582.html#55359'" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page582.html#55359">Application: Critical Path Analysis</A>
<DT>exception<DD><A NAME="tex2html129" HREF="page86.html#2792" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page86.html#2792">Array Subscripting Operator</A>, <A NAME="tex2html148" HREF="page94.html#3619" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page94.html#3619"><tt>First</tt> and <tt>Last</tt> Functions</A>
<DT>exception handler<DD><A NAME="tex2html1231" HREF="page616.html#58012" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page616.html#58012">Exceptions</A>
<DT>exceptions<DD><A NAME="tex2html1229" HREF="page616.html#58008" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page616.html#58008">Exceptions</A>
<DT>exchange sorting<DD><A NAME="tex2html957" HREF="page492.html#35372" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page492.html#35372">Exchange Sorting</A>
<DT>exchange sorts<DD><A NAME="tex2html941" HREF="page486.html#34604" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page486.html#34604">Sorter Class Hierarchy</A>
<DT>exclusive or<DD><A NAME="tex2html414" HREF="page218.html#11462" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page218.html#11462">Character String Keys</A>, <A NAME="tex2html416" HREF="page218.html#11487" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page218.html#11487">Character String Keys</A>
<DT>exclusive-or<DD><A NAME="tex2html828" HREF="page431.html#31671" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page431.html#31671">Buddy System for Storage </A>
<DT>exponent<DD><A NAME="tex2html406" HREF="page217.html#11395" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page217.html#11395">Floating-Point Keys</A>
<DT>exponential<DD><A NAME="tex2html71" HREF="page65.html#1646" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page65.html#1646">Conventions for Writing Big </A>
<DT>exponential cooling<DD><A NAME="tex2html925" HREF="page479.html#34327" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page479.html#34327">Simulated Annealing</A>
<DT>exponential distribution<DD><A NAME="tex2html916" HREF="page476.html#34101" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page476.html#34101">Implementation</A>
<DT>expression tree<DD><A NAME="tex2html518" HREF="page262.html#15904" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page262.html#15904">Expression Trees</A>
<DT>external node<DD><A NAME="tex2html488" HREF="page255.html#15313" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page255.html#15313"><I>N</I>-ary Trees</A>
<DT>external path length<DD><A NAME="tex2html579" HREF="page309.html#19238" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page309.html#19238">Unsuccessful Search</A>
<DT>factorial<DD><A NAME="tex2html12" HREF="page40.html#419" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page40.html#419">Analyzing Recursive Functions</A>
<DT>feasible solution<DD><A NAME="tex2html842" HREF="page443.html#32311" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page443.html#32311">Brute-Force Algorithm</A>
<DT>Fibonacci hashing method<DD><A NAME="tex2html396" HREF="page214.html#11249" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page214.html#11249">Fibonacci Hashing</A>
<DT>Fibonacci number<DD><A NAME="tex2html399" HREF="page214.html#11261" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page214.html#11261">Fibonacci Hashing</A>, <A NAME="tex2html598" HREF="page320.html#19996" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page320.html#19996">AVL Search Trees</A>
<DT>Fibonacci numbers<DD><A NAME="tex2html92" HREF="page73.html#1962" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page73.html#1962">Example-Fibonacci Numbers</A>, <A NAME="tex2html874" HREF="page457.html#32895" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page457.html#32895">Example-Computing Fibonacci Numbers</A>
<DL><DT>closed-form expression<DD><A NAME="tex2html96" HREF="page73.html#2048" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page73.html#2048">Example-Fibonacci Numbers</A>
<DT>generalized<DD><A NAME="tex2html883" HREF="page466.html#33285" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page466.html#33285">Example-Generalized Fibonacci Numbers</A>
</DL><DT>FIFO<DD><A NAME="tex2html284" HREF="page147.html#6610" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page147.html#6610">Queues</A>
<DT>fifo-in, first-out<DD><A NAME="tex2html283" HREF="page147.html#6608" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page147.html#6608">Queues</A>
<DT>find<DD><DL><DT>collapsing<DD><A NAME="tex2html779" HREF="page410.html#29830" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page410.html#29830">Collapsing Find</A>