page611.html

来自「Data Structures And Algorithms With Obje」· HTML 代码 · 共 601 行 · 第 1/5 页

<DT>minimal subgraph<DD><A NAME="tex2html1058" HREF="page573.html#52196">Minimum-Cost Spanning Trees</A>
<DT>minimum spanning tree<DD><A NAME="tex2html1066" HREF="page575.html#52511">Minimum-Cost Spanning Trees</A>
<DT>mixed linear congruential random number generator<DD><A NAME="tex2html840" HREF="page465.html#33772">Generating Random Numbers</A>
<DT>modulus<DD><A NAME="tex2html834" HREF="page465.html#33749">Generating Random Numbers</A>
<DT>Monte Carlo methods<DD><A NAME="tex2html855" HREF="page472.html#33954">Monte Carlo Methods</A>
<DT>multi-dimensional array<DD><A NAME="tex2html122" HREF="page89.html#2849">Multi-Dimensional Arrays</A>
<DT>multiple inheritance<DD><A NAME="tex2html1146" HREF="page600.html#57153">Derivation and Inheritance</A>
<DT>multiplication hashing method<DD><A NAME="tex2html355" HREF="page215.html#10635">Multiplication Method</A>
<DT>multiplicative linear congruential random number generator<DD><A NAME="tex2html838" HREF="page465.html#33769">Generating Random Numbers</A>
<DT>multiset<DD><A NAME="tex2html706" HREF="page396.html#27924">Multisets</A>
<DT>mutator<DD><A NAME="tex2html1131" HREF="page595.html#57028">PropertiesAccessors and Mutators</A>
<DT>N-ary tree<DD><DL><DT><I>N</I>-ary tree<DD><A NAME="tex2html444" HREF="page256.html#14672"><I>N</I>-ary Trees</A>
</DL><DT>N-queens problem<DD><DL><DT><I>N</I>-queens problem<DD><A NAME="tex2html863" HREF="page476.html#34212">Exercises</A>
</DL><DT>name<DD><A NAME="tex2html160" HREF="page112.html#4267">Abstract Data Types</A>, <A NAME="tex2html161" HREF="page112.html#4268">Abstract Data Types</A>, <A NAME="tex2html167" HREF="page112.html#4282">Abstract Data Types</A>, <A NAME="tex2html1102" HREF="page587.html#56853">Names</A>
<DT>namespace<DD><A NAME="tex2html1111" HREF="page589.html#56886">Scopes and Namespaces</A>
<DT><tt>Nary tree</tt><DD>textbf
<DT>negative cost cycle<DD><A NAME="tex2html1047" HREF="page564.html#51605">Single-Source Shortest Path</A>
<DT>nested class<DD><A NAME="tex2html395" HREF="page232.html#11818">Implementation</A>, <A NAME="tex2html1140" HREF="page598.html#57133">Nested Classes</A>
<DT>new-style class<DD><A NAME="tex2html193" HREF="page115.html#4375">Abstract Objects and the </A>, <A NAME="tex2html1150" HREF="page600.html#57159">Derivation and Inheritance</A>
<DT>Newton, Isaac.<DD><A NAME="tex2html641" HREF="page369.html#26548">Binomial Trees</A>
<DT>node<DD><A NAME="tex2html261" HREF="page156.html#6743">Applications</A>, <A NAME="tex2html424" HREF="page252.html#14219">Basics</A>, <A NAME="tex2html446" HREF="page256.html#14675"><I>N</I>-ary Trees</A>, <A NAME="tex2html460" HREF="page257.html#14933">Binary Trees</A>, <A NAME="tex2html961" HREF="page522.html#48558">Terminology</A>
<DT>non-recursive algorithm<DD><A NAME="tex2html96" HREF="page75.html#2081">Example-Fibonacci Numbers</A>
<DT>normalize<DD><A NAME="tex2html842" HREF="page465.html#33776">Generating Random Numbers</A>
<DT>null path length<DD><A NAME="tex2html628" HREF="page362.html#25077">Leftist Trees</A>, <A NAME="tex2html629" HREF="page362.html#25082">Leftist Trees</A>
<DT>object<DD><A NAME="tex2html1098" HREF="page586.html#56830">Objects and Types</A>
<DT>object-oriented programming<DD><A NAME="tex2html177" HREF="page112.html#4321">Abstract Data Types</A>
<DT>object-oriented programming language<DD><A NAME="tex2html178" HREF="page112.html#4324">Abstract Data Types</A>
<DT>objective function<DD><A NAME="tex2html784" HREF="page436.html#32139">Brute-Force Algorithm</A>
<DT>odd-even transposition sort<DD><A NAME="tex2html952" HREF="page517.html#47504">Exercises</A>
<DT>omega<DD><A NAME="tex2html75" HREF="page68.html#1727">An Asymptotic Lower Bound-Omega</A>
<DT>open addressing<DD><A NAME="tex2html400" HREF="page238.html#12578">Scatter Table using Open </A>
<DT>operator overloading<DD><A NAME="tex2html1135" HREF="page596.html#57084">Operator Overloading</A>
<DT>operator precedence<DD><A NAME="tex2html241" HREF="page144.html#5553">Applications</A>
<DT>optimal binary search tree<DD><A NAME="tex2html864" HREF="page476.html#34216">Exercises</A>
<DT>or<DD><A NAME="tex2html690" HREF="page391.html#27782">UnionIntersection, and Difference</A>
<DT>ordered list<DD><A NAME="tex2html287" HREF="page168.html#8543">Ordered Lists and Sorted </A>
<DT>ordered tree<DD><A NAME="tex2html451" HREF="page256.html#14874"><I>N</I>-ary Trees</A>, <A NAME="tex2html463" HREF="page257.html#14942">Binary Trees</A>
<DT>ordinal number<DD><A NAME="tex2html308" HREF="page184.html#9490">Positions of Items in </A>
<DT>oriented tree<DD><A NAME="tex2html453" HREF="page256.html#14877"><I>N</I>-ary Trees</A>
<DT>out-degree<DD><A NAME="tex2html968" HREF="page522.html#48577">Terminology</A>
<DT>overloading operators<DD><A NAME="tex2html1136" HREF="page596.html#57085">Operator Overloading</A>
<DT>override<DD><A NAME="tex2html191" HREF="page114.html#4365">Class Hierarchy</A>, <A NAME="tex2html1153" HREF="page600.html#57207">Derivation and Inheritance</A>, <A NAME="tex2html1154" HREF="page600.html#57212">Derivation and Inheritance</A>
<DT>parameter passing<DD><A NAME="tex2html1114" HREF="page590.html#56891">Parameter Passing</A>
<DT>parent<DD><A NAME="tex2html263" HREF="page156.html#6747">Applications</A>, <A NAME="tex2html428" HREF="page253.html#14456">Terminology</A>
<DT>parentheses<DD><A NAME="tex2html242" HREF="page144.html#5555">Applications</A>
<DT>partial order<DD><A NAME="tex2html701" HREF="page392.html#27803">Comparing Sets</A>
<DT>partition<DD><A NAME="tex2html718" HREF="page403.html#28103">Partitions</A>, <A NAME="tex2html1075" HREF="page578.html#53607">Kruskal's Algorithm</A>
<DT>Pascal's triangle<DD><A NAME="tex2html824" HREF="page460.html#33205">Example-Computing Binomial Coefficients</A>
<DT>Pascal, Blaise<DD><A NAME="tex2html823" HREF="page460.html#33207">Example-Computing Binomial Coefficients</A>
<DT>pass-by-reference<DD><A NAME="tex2html1115" HREF="page590.html#56893">Parameter Passing</A>
<DT>path<DD><A NAME="tex2html974" HREF="page522.html#48601">Terminology</A>
<DL><DT>access<DD><A NAME="tex2html556" HREF="page324.html#19385">Inserting Items into an </A>
</DL><DT>path length<DD><DL><DT>external<DD><A NAME="tex2html535" HREF="page308.html#18554">Unsuccessful Search</A>
<DT>internal<DD><A NAME="tex2html533" HREF="page308.html#18551">Unsuccessful Search</A>
<DT>weighted<DD><A NAME="tex2html1044" HREF="page563.html#51335">Shortest-Path Algorithms</A>
</DL><DT>perfect binary tree<DD><A NAME="tex2html526" HREF="page304.html#18377">Searching a Binary Tree</A>, <A NAME="tex2html547" HREF="page319.html#19235">AVL Search Trees</A>
<DT>period<DD><A NAME="tex2html836" HREF="page465.html#33757">Generating Random Numbers</A>
<DT>pivot<DD><A NAME="tex2html898" HREF="page490.html#36384">Quicksort</A>
<DT>plain integer<DD><A NAME="tex2html3" HREF="page38.html#322">The Basic Axioms</A>
<DT>Polish notation<DD><A NAME="tex2html244" HREF="page144.html#5559">Applications</A>
<DT>polymorphism<DD><A NAME="tex2html192" HREF="page114.html#4367">Class Hierarchy</A>, <A NAME="tex2html1155" HREF="page601.html#57225">Polymorphism</A>
<DT>polynomial<DD><A NAME="tex2html58" HREF="page63.html#1555">About Polynomials</A>, <A NAME="tex2html77" HREF="page70.html#1801">About Polynomials Again</A>
<DT>postcondition<DD><A NAME="tex2html328" HREF="page192.html#9855">Inserting Items in a </A>
<DT>postorder traversal<DD><A NAME="tex2html470" HREF="page260.html#15255">Postorder Traversal</A>
<DT>power set<DD><A NAME="tex2html687" HREF="page389.html#27679">Array and Bit-Vector Sets</A>
<DT>precede lexicographically<DD><A NAME="tex2html946" HREF="page514.html#46264">Radix Sort</A>
<DT>precondition<DD><A NAME="tex2html327" HREF="page192.html#9853">Inserting Items in a </A>
<DT>predecessor<DD><A NAME="tex2html293" HREF="page171.html#8658">Instance Attributes</A>, <A NAME="tex2html976" HREF="page523.html#48614">More Terminology</A>
<DT>prefix notation<DD><A NAME="tex2html480" HREF="page265.html#15461">Prefix Notation</A>
<DT>preorder traversal<DD><A NAME="tex2html468" HREF="page259.html#15245">Preorder Traversal</A>
<DT>prepend<DD><A NAME="tex2html148" HREF="page104.html#3913"><tt>prepend</tt> Method</A>
<DT>Prim's algorithm<DD><A NAME="tex2html1069" HREF="page576.html#52874">Prim's Algorithm</A>
<DT>primary clustering<DD><A NAME="tex2html404" HREF="page239.html#13241">Linear Probing</A>
<DT>prime<DD><DL><DT>relatively<DD><A NAME="tex2html354" HREF="page215.html#10642">Multiplication Method</A>
</DL><DT>priority queue<DD><DL><DT>mergeable<DD><A NAME="tex2html606" HREF="page352.html#23409">Basics</A>
</DL><DT>probability density function<DD><A NAME="tex2html854" HREF="page471.html#33937">Exponentially Distributed Random Variables</A>
<DT>probe sequence<DD><A NAME="tex2html401" HREF="page238.html#12580">Scatter Table using Open </A>
<DT>proper subset<DD><A NAME="tex2html696" HREF="page392.html#27796">Comparing Sets</A>
<DT>proper superset<DD><A NAME="tex2html699" HREF="page392.html#27800">Comparing Sets</A>
<DT>pruning a solution space<DD><A NAME="tex2html803" HREF="page445.html#32589">Branch-and-Bound Solvers</A>
<DT>pseudorandom<DD><A NAME="tex2html831" HREF="page465.html#33744">Generating Random Numbers</A>
<DT>Python programming language<DD><A NAME="tex2html158" HREF="page112.html#4264">Abstract Data Types</A>
<DT>quadratic<DD><A NAME="tex2html72" HREF="page67.html#1716">Conventions for Writing Big </A>
<DT>quadratic probing<DD><A NAME="tex2html405" HREF="page240.html#13244">Quadratic Probing</A>
<DT>queue<DD><A NAME="tex2html224" HREF="page130.html#5005">StacksQueues, and Deques</A>
<DT>quicksort<DD><A NAME="tex2html897" HREF="page490.html#36380">Quicksort</A>
<DT>radix sorting<DD><A NAME="tex2html943" HREF="page514.html#45414">Radix Sort</A>
<DT>raise<DD><A NAME="tex2html1169" HREF="page607.html#57451">Exceptions</A>
<DT>random number generator<DD><DL><DT>linear congruential<DD><A NAME="tex2html833" HREF="page465.html#33747">Generating Random Numbers</A>
<DT>mixed linear congruential<DD><A NAME="tex2html841" HREF="page465.html#33773">Generating Random Numbers</A>
<DT>multiplicative linear congruential<DD><A NAME="tex2html839" HREF="page465.html#33770">Generating Random Numbers</A>
</DL><DT>random numbers<DD><A NAME="tex2html830" HREF="page465.html#33742">Generating Random Numbers</A>
<DT>random variable<DD><A NAME="tex2html849" HREF="page468.html#33850">Random Variables</A>
<DT>rank<DD><A NAME="tex2html738" HREF="page411.html#29509">Union by Height or </A>
<DT>record<DD><A NAME="tex2html179" HREF="page112.html#4328">Abstract Data Types</A>
<DT>recurrence relation<DD><A NAME="tex2html16" HREF="page42.html#483">Analyzing Recursive Methods</A>
<DT>recursive algorithm<DD><A NAME="tex2html14" HREF="page42.html#437">Analyzing Recursive Methods</A>, <A NAME="tex2html98" HREF="page75.html#2084">Example-Fibonacci Numbers</A>
<DT>reference count<DD><A NAME="tex2html760" HREF="page422.html#29821">Reference Counting Garbage Collection</A>
<DT>reference counting garbage collection<DD><A NAME="tex2html761" HREF="page422.html#29822">Reference Counting Garbage Collection</A>
<DT>reflexive<DD><A NAME="tex2html743" HREF="page412.html#29529">Applications</A>
<DT>relation<DD><DL><DT>equivalence<DD><A NAME="tex2html742" HREF="page412.html#29526">Applications</A>
</DL><DT>relatively prime<DD><A NAME="tex2html353" HREF="page215.html#10641">Multiplication Method</A>
<DT>repeated substitution<DD><A NAME="tex2html17" HREF="page43.html#487">Solving Recurrence Relations-Repeated Substitution</A>
<DT>Reverse-Polish notation<DD><A NAME="tex2html245" HREF="page144.html#5571">Applications</A>
<DT>right subtree<DD><A NAME="tex2html462" HREF="page257.html#14939">Binary Trees</A>
<DT>RL rotation<DD><A NAME="tex2html571" HREF="page327.html#20293">Double Rotations</A>
<DT>root<DD><A NAME="tex2html425" HREF="page252.html#14222">Basics</A>, <A NAME="tex2html769" HREF="page425.html#30696">Mark-and-Sweep Garbage Collection</A>
<DT>rotation<DD><DL><DT>AVL<DD><A NAME="tex2html558" HREF="page325.html#19389">Balancing AVL Trees</A>
<DT>double<DD><A NAME="tex2html568" HREF="page327.html#20288">Double Rotations</A>
<DT>LL<DD><A NAME="tex2html561" HREF="page326.html#19770">Single Rotations</A>, <A NAME="tex2html598" HREF="page347.html#22071">Removing Items from a </A>
<DT>LL<DD><A NAME="tex2html561" HREF="page326.html#19770">Single Rotations</A>, <A NAME="tex2html598" HREF="page347.html#22071">Removing Items from a </A>
<DT>LR<DD><A NAME="tex2html570" HREF="page327.html#20291">Double Rotations</A>
<DT>RL<DD><A NAME="tex2html572" HREF="page327.html#20294">Double Rotations</A>
<DT>RR<DD><A NAME="tex2html563" HREF="page326.html#19775">Single Rotations</A>, <A NAME="tex2html600" HREF="page347.html#22576">Removing Items from a </A>
<DT>RR<DD><A NAME="tex2html563" HREF="page326.html#19775">Single Rotations</A>, <A NAME="tex2html600" HREF="page347.html#22576">Removing Items from a </A>
<DT>single<DD><A NAME="tex2html566" HREF="page327.html#20285">Double Rotations</A>
</DL><DT>row-major order<DD><A NAME="tex2html124" HREF="page90.html#2865">Array Subscript Calculations</A>
<DT>RPN<DD>seeReverse-Polish notation
<DT>RR rotation<DD><A NAME="tex2html562" HREF="page326.html#19774">Single Rotations</A>
<DL><DT>in a B-tree<DD><A NAME="tex2html599" HREF="page347.html#22575">Removing Items from a </A>
</DL><DT>scales<DD><A NAME="tex2html790" HREF="page440.html#32185">Example-Balancing Scales</A>