page611.html

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

<DT>scatter tables<DD><A NAME="tex2html390" HREF="page230.html#11407">Scatter Tables</A>
<DT>scope<DD><A NAME="tex2html164" HREF="page112.html#4271">Abstract Data Types</A>, <A NAME="tex2html170" HREF="page112.html#4289">Abstract Data Types</A>, <A NAME="tex2html1104" HREF="page589.html#56875">Scopes and Namespaces</A>
<DL><DT>built-in<DD><A NAME="tex2html1110" HREF="page589.html#56884">Scopes and Namespaces</A>
<DT>global<DD><A NAME="tex2html1108" HREF="page589.html#56881">Scopes and Namespaces</A>
<DT>local<DD><A NAME="tex2html1106" HREF="page589.html#56878">Scopes and Namespaces</A>
</DL><DT>search interval<DD><A NAME="tex2html331" HREF="page193.html#10132">Locating Items in an </A>
<DT>search tree<DD><DL><DT><I>M</I>-way<DD><A NAME="tex2html518" HREF="page300.html#18001"><I>M</I>-Way Search Trees</A>
<DT>binary<DD><A NAME="tex2html524" HREF="page301.html#18073">Binary Search Trees</A>
</DL><DT>seed<DD><A NAME="tex2html835" HREF="page465.html#33751">Generating Random Numbers</A>
<DT>selection sorting<DD><A NAME="tex2html910" HREF="page497.html#37873">Selection Sorting</A>
<DT>selection sorts<DD><A NAME="tex2html876" HREF="page482.html#34414">Sorter Class Hierarchy</A>
<DT>sentinel<DD><A NAME="tex2html137" HREF="page97.html#3457">Singly-Linked Lists</A>, <A NAME="tex2html995" HREF="page529.html#49143">Adjacency Matrices</A>
<DT>separate chaining<DD><A NAME="tex2html385" HREF="page224.html#11060">Separate Chaining</A>
<DT>set<DD><A NAME="tex2html671" HREF="page386.html#27530">SetsMultisets, and Partitions</A>
<DT>setter<DD><A NAME="tex2html1133" HREF="page595.html#57040">PropertiesAccessors and Mutators</A>
<DT>shallow copy<DD><A NAME="tex2html116" HREF="page85.html#2730"><tt>__copy__</tt> Method</A>
<DT>sibling<DD><A NAME="tex2html429" HREF="page253.html#14459">Terminology</A>
<DT>sign<DD><A NAME="tex2html366" HREF="page219.html#10777">Floating-Point Keys</A>
<DT>significant<DD><A NAME="tex2html368" HREF="page219.html#10781">Floating-Point Keys</A>
<DT>simple cycle<DD><A NAME="tex2html979" HREF="page523.html#48624">More Terminology</A>
<DT>simulated annealing<DD><A NAME="tex2html858" HREF="page474.html#34146">Simulated Annealing</A>
<DT>simulation time<DD><A NAME="tex2html666" HREF="page382.html#27285">Discrete Event Simulation</A>
<DT>single rotation<DD><A NAME="tex2html565" HREF="page327.html#20284">Double Rotations</A>
<DT>single-ended queue<DD><A NAME="tex2html250" HREF="page147.html#5960">Queues</A>
<DT>singleton<DD><A NAME="tex2html750" HREF="page413.html#29619">Exercises</A>, <A NAME="tex2html847" HREF="page467.html#33847">Implementation</A>
<DT>singly-linked list<DD><A NAME="tex2html281" HREF="page165.html#7876">Doubly-Linked and Circular Lists</A>
<DT>size<DD><A NAME="tex2html166" HREF="page112.html#4273">Abstract Data Types</A>
<DT>slack time<DD><A NAME="tex2html1086" HREF="page581.html#55498">Application: Critical Path Analysis</A>
<DT>slide<DD><A NAME="tex2html781" HREF="page430.html#31882">Handles</A>
<DT>solution space<DD><A NAME="tex2html791" HREF="page440.html#32234">Example-Balancing Scales</A>
<DT>solver<DD><A NAME="tex2html797" HREF="page442.html#32491">Abstract Backtracking Solvers</A>
<DT>sort<DD><DL><DT>topological<DD><A NAME="tex2html1026" HREF="page555.html#50448">Topological Sort</A>
</DL><DT>sorted list<DD><A NAME="tex2html288" HREF="page168.html#8545">Ordered Lists and Sorted </A>, <A NAME="tex2html322" HREF="page190.html#9803">Sorted Lists</A>, <A NAME="tex2html608" HREF="page352.html#23424">Basics</A>
<DT>sorter<DD><A NAME="tex2html870" HREF="page480.html#34370">Sorting and Sorters</A>
<DT>sorting<DD><DL><DT>in place<DD><A NAME="tex2html912" HREF="page497.html#37877">Selection Sorting</A>
<DT>in-place<DD><A NAME="tex2html883" HREF="page483.html#34439">Insertion Sorting</A>
</DL><DT>sorting algorithm<DD><DL><DT>bucket sort<DD><A NAME="tex2html104" HREF="page76.html#2304">Example-Bucket Sort</A>
</DL><DT>sorting by distribution<DD><A NAME="tex2html936" HREF="page511.html#44994">Distribution Sorting</A>
<DT>sorting by exchanging<DD><A NAME="tex2html890" HREF="page488.html#35164">Exchange Sorting</A>
<DT>sorting by insertion<DD><A NAME="tex2html880" HREF="page483.html#34428">Insertion Sorting</A>
<DT>sorting by merging<DD><A NAME="tex2html929" HREF="page505.html#42627">Merge Sorting</A>
<DT>sorting by selection<DD><A NAME="tex2html909" HREF="page497.html#37872">Selection Sorting</A>
<DT>source<DD><A NAME="tex2html1096" HREF="page583.html#56191">Exercises</A>
<DT>spanning tree<DD><A NAME="tex2html1060" HREF="page573.html#52205">Minimum-Cost Spanning Trees</A>
<DL><DT>breadth-first<DD><A NAME="tex2html1062" HREF="page574.html#52496">Constructing Spanning Trees</A>
<DT>depth-first<DD><A NAME="tex2html1064" HREF="page574.html#52501">Constructing Spanning Trees</A>
<DT>minimum<DD><A NAME="tex2html1067" HREF="page575.html#52512">Minimum-Cost Spanning Trees</A>
</DL><DT>sparse graph<DD><A NAME="tex2html998" HREF="page530.html#49154">Sparse vs. Dense Graphs</A>
<DT>sparse matrix<DD><A NAME="tex2html996" HREF="page529.html#49146">Adjacency Matrices</A>
<DT>specializes<DD><A NAME="tex2html183" HREF="page114.html#4341">Class Hierarchy</A>
<DT>stable sorts<DD><A NAME="tex2html869" HREF="page479.html#34364">Basics</A>
<DT>stack<DD><A NAME="tex2html228" HREF="page131.html#5022">Stacks</A>
<DT>stack frame<DD><A NAME="tex2html5" HREF="page38.html#335">The Basic Axioms</A>
<DT>state<DD><A NAME="tex2html665" HREF="page382.html#27082">Discrete Event Simulation</A>
<DT>static binding<DD><A NAME="tex2html174" HREF="page112.html#4301">Abstract Data Types</A>
<DT>static method<DD><A NAME="tex2html1138" HREF="page597.html#57114">Static Methods</A>
<DT>Stirling numbers<DD><A NAME="tex2html717" HREF="page403.html#28128">Partitions</A>, <A NAME="tex2html719" HREF="page403.html#28126">Partitions</A>
<DT>stop-and-copy garbage collection<DD><A NAME="tex2html773" HREF="page427.html#30968">Stop-and-Copy Garbage Collection</A>
<DT>straight insertion sorting<DD><A NAME="tex2html884" HREF="page484.html#35070">Straight Insertion Sort</A>
<DT>straight selection sorting<DD><A NAME="tex2html914" HREF="page498.html#37881">Straight Selection Sorting</A>
<DT>strongly connected<DD><A NAME="tex2html1036" HREF="page560.html#50937">Connectedness of a Directed </A>
<DT>subgraph<DD><A NAME="tex2html1057" HREF="page573.html#52193">Minimum-Cost Spanning Trees</A>
<DL><DT>minimal<DD><A NAME="tex2html1059" HREF="page573.html#52197">Minimum-Cost Spanning Trees</A>
</DL><DT>subset<DD><A NAME="tex2html695" HREF="page392.html#27794">Comparing Sets</A>
<DL><DT>proper<DD><A NAME="tex2html697" HREF="page392.html#27797">Comparing Sets</A>
</DL><DT>subtraction<DD><A NAME="tex2html679" HREF="page386.html#27549">SetsMultisets, and Partitions</A>
<DT>subtree<DD><A NAME="tex2html266" HREF="page156.html#6754">Applications</A>
<DT>successor<DD><A NAME="tex2html292" HREF="page171.html#8654">Instance Attributes</A>, <A NAME="tex2html975" HREF="page523.html#48610">More Terminology</A>
<DT>superclass<DD><A NAME="tex2html1162" HREF="page602.html#57317">Example-Graphical Objects</A>
<DT>superset<DD><A NAME="tex2html698" HREF="page392.html#27799">Comparing Sets</A>
<DL><DT>proper<DD><A NAME="tex2html700" HREF="page392.html#27801">Comparing Sets</A>
</DL><DT>symbol table<DD><A NAME="tex2html340" HREF="page205.html#10534">HashingHash Tables, and </A>, <A NAME="tex2html419" HREF="page248.html#13891">Applications</A>
<DT>symmetric<DD><A NAME="tex2html744" HREF="page412.html#29531">Applications</A>
<DT>symmetric difference<DD><A NAME="tex2html747" HREF="page413.html#29589">Exercises</A>
<DT>tail<DD><A NAME="tex2html135" HREF="page97.html#3450">Singly-Linked Lists</A>, <A NAME="tex2html136" HREF="page97.html#3453">Singly-Linked Lists</A>
<DT>telescoping<DD><A NAME="tex2html529" HREF="page307.html#18453">Solving The Recurrence-Telescoping</A>, <A NAME="tex2html815" HREF="page452.html#32837">Running Time of Divide-and-Conquer </A>
<DT>temperature<DD><A NAME="tex2html860" HREF="page474.html#34152">Simulated Annealing</A>
<DT>tertiary tree<DD><A NAME="tex2html449" HREF="page256.html#14691"><I>N</I>-ary Trees</A>
<DT>theta<DD><A NAME="tex2html79" HREF="page71.html#1888">More Notation-Theta and Little </A>
<DT>tight asymptotic bound<DD><A NAME="tex2html63" HREF="page65.html#1659">Tight Big Oh Bounds</A>
<DT>time<DD><DL><DT>simulation<DD><A NAME="tex2html667" HREF="page382.html#27286">Discrete Event Simulation</A>
</DL><DT>topological sort<DD><A NAME="tex2html1025" HREF="page555.html#50447">Topological Sort</A>
<DT>total order<DD><A NAME="tex2html866" HREF="page479.html#34348">Basics</A>
<DL><DT>binary trees<DD><A NAME="tex2html510" HREF="page293.html#16605">Comparing Trees</A>
</DL><DT>transitive<DD><A NAME="tex2html321" HREF="page190.html#9808">Sorted Lists</A>, <A NAME="tex2html745" HREF="page412.html#29533">Applications</A>, <A NAME="tex2html868" HREF="page479.html#34352">Basics</A>
<DT>traversal<DD><A NAME="tex2html466" HREF="page258.html#15100">Tree Traversals</A>, <A NAME="tex2html792" HREF="page440.html#32434">Example-Balancing Scales</A>, <A NAME="tex2html1014" HREF="page548.html#49905">Graph Traversals</A>
<DL><DT>breadth-first<DD><A NAME="tex2html475" HREF="page262.html#15273">Breadth-First Traversal</A>, <A NAME="tex2html1022" HREF="page552.html#50230">Breadth-First Traversal</A>
<DT>breadth-first<DD><A NAME="tex2html475" HREF="page262.html#15273">Breadth-First Traversal</A>, <A NAME="tex2html1022" HREF="page552.html#50230">Breadth-First Traversal</A>
<DT>depth-first<DD><A NAME="tex2html1018" HREF="page549.html#49910">Depth-First Traversal</A>
<DT>inorder<DD><A NAME="tex2html473" HREF="page261.html#15265">Inorder Traversal</A>, <A NAME="tex2html537" HREF="page309.html#18590">Traversing a Search Tree</A>
<DT>inorder<DD><A NAME="tex2html473" HREF="page261.html#15265">Inorder Traversal</A>, <A NAME="tex2html537" HREF="page309.html#18590">Traversing a Search Tree</A>
<DT>postorder<DD><A NAME="tex2html471" HREF="page260.html#15256">Postorder Traversal</A>
<DT>preorder<DD><A NAME="tex2html469" HREF="page259.html#15246">Preorder Traversal</A>
</DL><DT>tree<DD><A NAME="tex2html423" HREF="page252.html#14217">Basics</A>
<DL><DT><I>N</I>-ary<DD><A NAME="tex2html445" HREF="page256.html#14673"><I>N</I>-ary Trees</A>
<DT>binary<DD><A NAME="tex2html459" HREF="page257.html#14931">Binary Trees</A>
<DT>equivalence<DD><A NAME="tex2html509" HREF="page293.html#16579">Comparing Trees</A>
<DT>expression<DD><A NAME="tex2html478" HREF="page263.html#15284">Expression Trees</A>
<DT>height<DD><A NAME="tex2html434" HREF="page254.html#14483">More Terminology</A>
<DT>internal path length<DD><A NAME="tex2html528" HREF="page306.html#18401">Successful Search</A>
<DT>leftist<DD><A NAME="tex2html631" HREF="page362.html#25091">Leftist Trees</A>
<DT>ordered<DD><A NAME="tex2html452" HREF="page256.html#14875"><I>N</I>-ary Trees</A>, <A NAME="tex2html464" HREF="page257.html#14943">Binary Trees</A>
<DT>ordered<DD><A NAME="tex2html452" HREF="page256.html#14875"><I>N</I>-ary Trees</A>, <A NAME="tex2html464" HREF="page257.html#14943">Binary Trees</A>
<DT>oriented<DD><A NAME="tex2html454" HREF="page256.html#14878"><I>N</I>-ary Trees</A>
<DT>search<DD>seesearch tree
<DT>tertiary<DD><A NAME="tex2html450" HREF="page256.html#14692"><I>N</I>-ary Trees</A>
<DT>traversal<DD><A NAME="tex2html467" HREF="page258.html#15101">Tree Traversals</A>
</DL><DT>tree traversal<DD><A NAME="tex2html267" HREF="page156.html#7031">Applications</A>
<DT>tuple<DD><A NAME="tex2html220" HREF="page127.html#4818">Associations</A>
<DT>type<DD><A NAME="tex2html165" HREF="page112.html#4272">Abstract Data Types</A>, <A NAME="tex2html1099" HREF="page586.html#56834">Objects and Types</A>
<DT>undirected arc<DD><A NAME="tex2html986" HREF="page525.html#48779">Undirected Graphs</A>
<DT>undirected graph<DD><A NAME="tex2html988" HREF="page525.html#48785">Undirected Graphs</A>
<DT>Unicode character set<DD><A NAME="tex2html341" HREF="page207.html#10564">Example</A>
<DT>Unicode escape<DD><A NAME="tex2html342" HREF="page207.html#10566">Example</A>
<DT>uniform distribution<DD><A NAME="tex2html347" HREF="page210.html#10605">Spreading Keys Evenly</A>
<DT>uniform hashing model<DD><A NAME="tex2html416" HREF="page247.html#13502">Average Case Analysis</A>
<DT>union<DD><A NAME="tex2html674" HREF="page386.html#27538">SetsMultisets, and Partitions</A>, <A NAME="tex2html681" HREF="page387.html#27615">Basics</A>, <A NAME="tex2html711" HREF="page399.html#27985">UnionIntersection, an