page611.html

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

HTML
601 行
字号
12345
<HTML><HEAD><TITLE>Index</TITLE></HEAD><BODY bgcolor="#FFFFFF"> <a href="../index.html" target="_top"><img src="../icons/usins.gif" alt="Logo" align=right></a><b>Data Structures and Algorithms with Object-Oriented Design Patterns in Python</b><br><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="../icons/next_motif_gr.gif"> <A NAME="tex2html8161" HREF="book.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="../icons/up_motif.gif"></A> <A NAME="tex2html8157" HREF="page610.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="../icons/previous_motif.gif"></A>   <BR><HR><P><H2><A NAME="SECTION0021000000000000000000">Index</A></H2><DL><DT><I>o</I><DD>seebig oh, seelittle oh<DT> <IMG WIDTH=9 HEIGHT=16 ALIGN=MIDDLE ALT="tex2html_wrap_inline57997" SRC="img112.gif"  ><DD>seeEuler's constant<DT> <IMG WIDTH=10 HEIGHT=12 ALIGN=BOTTOM ALT="tex2html_wrap_inline59365" SRC="img404.gif"  ><DD>seeomega<DT> <IMG WIDTH=11 HEIGHT=13 ALIGN=BOTTOM ALT="tex2html_wrap_inline59561" SRC="img431.gif"  ><DD>seetheta<DT> <IMG WIDTH=8 HEIGHT=11 ALIGN=BOTTOM ALT="tex2html_wrap_inline62235" SRC="img936.gif"  ><DD>seelambda<DT><tt>__init__</tt> method<DD><A NAME="tex2html1127" HREF="page594.html#57496"><tt>__init__</tt> Method</A><DT>abstract algorithms<DD><A NAME="tex2html484" HREF="page268.html#15564">Tree Traversals</A><DT>abstract class<DD><A NAME="tex2html181" HREF="page114.html#4335">Class Hierarchy</A>, <A NAME="tex2html184" HREF="page114.html#4350">Class Hierarchy</A>, <A NAME="tex2html186" HREF="page114.html#4354">Class Hierarchy</A>, <A NAME="tex2html1163" HREF="page605.html#57406">Algorithmic Abstraction</A><DT>abstract data type<DD><A NAME="tex2html107" HREF="page81.html#2526">Foundational Data Structures</A>, <A NAME="tex2html176" HREF="page112.html#4316">Abstract Data Types</A><DT>abstract method<DD><A NAME="tex2html187" HREF="page114.html#4356">Class Hierarchy</A><DT>abstract property<DD><A NAME="tex2html188" HREF="page114.html#4358">Class Hierarchy</A><DT>abstract solver<DD><A NAME="tex2html798" HREF="page442.html#32492">Abstract Backtracking Solvers</A><DT>abstract sorter<DD><A NAME="tex2html871" HREF="page480.html#34371">Sorting and Sorters</A><DT>access path<DD><A NAME="tex2html555" HREF="page324.html#19384">Inserting Items into an </A><DT>accessor<DD><A NAME="tex2html119" HREF="page87.html#2794"><tt>Array</tt> Properties</A>, <A NAME="tex2html120" HREF="page87.html#2799"><tt>Array</tt> Properties</A>, <A NAME="tex2html1130" HREF="page595.html#57020">PropertiesAccessors and Mutators</A><DT>activation record<DD><A NAME="tex2html6" HREF="page38.html#336">The Basic Axioms</A><DT>activity-node graph<DD><A NAME="tex2html1081" HREF="page581.html#54657">Application: Critical Path Analysis</A><DT>actual parameter<DD><A NAME="tex2html1116" HREF="page590.html#56898">Parameter Passing</A><DT>acyclic<DD><DL><DT>directed graph<DD><A NAME="tex2html984" HREF="page524.html#48638">Directed Acyclic Graphs</A></DL><DT>adapter<DD><A NAME="tex2html490" HREF="page270.html#15618">PreorderInorder, and Postorder </A>, <A NAME="tex2html491" HREF="page270.html#15630">PreorderInorder, and Postorder </A><DT>address<DD><A NAME="tex2html168" HREF="page112.html#4284">Abstract Data Types</A><DT>adjacency lists<DD><A NAME="tex2html1003" HREF="page531.html#49168">Adjacency Lists</A><DT>adjacency matrix<DD><A NAME="tex2html993" HREF="page529.html#49121">Adjacency Matrices</A><DT>adjacent<DD><A NAME="tex2html965" HREF="page522.html#48572">Terminology</A><DT>ADT<DD>seeabstract data type<DT>algorithmic abstraction<DD><A NAME="tex2html1165" HREF="page605.html#57409">Algorithmic Abstraction</A><DT>ancestor<DD><A NAME="tex2html435" HREF="page254.html#14485">More Terminology</A><DL><DT>proper<DD><A NAME="tex2html436" HREF="page254.html#14487">More Terminology</A></DL><DT>and<DD><A NAME="tex2html692" HREF="page391.html#27786">UnionIntersection, and Difference</A><DT>annealing<DD><A NAME="tex2html859" HREF="page474.html#34147">Simulated Annealing</A><DT>annealing schedule<DD><A NAME="tex2html861" HREF="page474.html#34155">Simulated Annealing</A><DT>arc<DD><DL><DT>directed<DD><A NAME="tex2html964" HREF="page522.html#48568">Terminology</A><DT>undirected<DD><A NAME="tex2html987" HREF="page525.html#48780">Undirected Graphs</A></DL><DT>arithmetic series<DD><A NAME="tex2html37" HREF="page51.html#914">About Arithmetic Series Summation</A><DT>arithmetic series summation<DD><A NAME="tex2html36" HREF="page50.html#906">An example-Geometric Series Summation</A>, <A NAME="tex2html38" HREF="page51.html#918">About Arithmetic Series Summation</A><DT>arity<DD><A NAME="tex2html500" HREF="page281.html#16070"><I>N</I>-ary Trees</A><DT>array<DD><A NAME="tex2html108" HREF="page81.html#2529">Foundational Data Structures</A><DT>ASCII<DD><A NAME="tex2html372" HREF="page220.html#10840">Character String Keys</A><DT>association<DD><A NAME="tex2html213" HREF="page126.html#4790">Searchable Containers</A><DT>asymptotic behavior<DD><A NAME="tex2html52" HREF="page58.html#1377">Asymptotic Notation</A><DT>attribute<DD><DL><DT>class<DD><A NAME="tex2html1121" HREF="page592.html#56934">InstancesInstance Attributes and </A><DT>instance<DD><A NAME="tex2html1123" HREF="page592.html#56938">InstancesInstance Attributes and </A></DL><DT>attributes<DD><A NAME="tex2html159" HREF="page112.html#4266">Abstract Data Types</A><DT>AVL balance condition<DD><A NAME="tex2html550" HREF="page319.html#19248">AVL Search Trees</A><DT>AVL rotation<DD><A NAME="tex2html557" HREF="page325.html#19388">Balancing AVL Trees</A><DT>AVL tree<DD><A NAME="tex2html609" HREF="page352.html#23426">Basics</A><DT>B-Tree<DD><A NAME="tex2html586" HREF="page340.html#20983">B-Trees</A>, <A NAME="tex2html589" HREF="page340.html#20994">B-Trees</A><DT>Bachmann, P.<DD><A NAME="tex2html53" HREF="page59.html#1379">An Asymptotic Upper Bound-Big </A><DT>backtracking algorithms<DD><A NAME="tex2html787" HREF="page439.html#32181">Backtracking Algorithms</A><DT>bag<DD><A NAME="tex2html221" HREF="page129.html#4915">Projects</A>, <A NAME="tex2html707" HREF="page396.html#27926">Multisets</A><DT>balance condition<DD><A NAME="tex2html548" HREF="page319.html#19240">AVL Search Trees</A>, <A NAME="tex2html588" HREF="page340.html#20989">B-Trees</A><DL><DT>AVL<DD><A NAME="tex2html551" HREF="page319.html#19249">AVL Search Trees</A></DL><DT>base class<DD><A NAME="tex2html189" HREF="page114.html#4361">Class Hierarchy</A>, <A NAME="tex2html1145" HREF="page600.html#57151">Derivation and Inheritance</A><DT>big oh<DD><A NAME="tex2html54" HREF="page59.html#1384">An Asymptotic Upper Bound-Big </A><DL><DT>tightness<DD><A NAME="tex2html62" HREF="page65.html#1656">Tight Big Oh Bounds</A>, <A NAME="tex2html78" HREF="page71.html#1908">More Notation-Theta and Little </A><DT>tightness<DD><A NAME="tex2html62" HREF="page65.html#1656">Tight Big Oh Bounds</A>, <A NAME="tex2html78" HREF="page71.html#1908">More Notation-Theta and Little </A><DT>transitive property<DD><A NAME="tex2html57" HREF="page62.html#1539">Properties of Big Oh</A></DL><DT>binary digit<DD><A NAME="tex2html648" HREF="page370.html#26597">Binomial Queues</A><DT>binary heap<DD><A NAME="tex2html916" HREF="page500.html#39071">Sorting with a Heap</A><DT>binary operator<DD><A NAME="tex2html240" HREF="page144.html#5549">Applications</A><DT>binary search<DD><A NAME="tex2html330" HREF="page193.html#10118">Locating Items in an </A>, <A NAME="tex2html809" HREF="page449.html#32667">Example-Binary Search</A><DT>binary search tree<DD><A NAME="tex2html522" HREF="page301.html#18067">Binary Search Trees</A>, <A NAME="tex2html523" HREF="page301.html#18072">Binary Search Trees</A><DT>binary tree<DD><A NAME="tex2html457" HREF="page257.html#14925">Binary Trees</A>, <A NAME="tex2html458" HREF="page257.html#14930">Binary Trees</A><DL><DT>complete<DD><A NAME="tex2html614" HREF="page354.html#23459">Complete Trees</A></DL><DT>binding<DD><A NAME="tex2html172" HREF="page112.html#4296">Abstract Data Types</A>, <A NAME="tex2html1103" HREF="page587.html#56856">Names</A><DT>binomial<DD><A NAME="tex2html644" HREF="page369.html#26528">Binomial Trees</A><DT>binomial coefficient<DD><A NAME="tex2html645" HREF="page369.html#26543">Binomial Trees</A><DT>bit<DD><A NAME="tex2html650" HREF="page370.html#26600">Binomial Queues</A><DT>Boolean<DD><DL><DT>and<DD><A NAME="tex2html693" HREF="page391.html#27787">UnionIntersection, and Difference</A><DT>or<DD><A NAME="tex2html691" HREF="page391.html#27783">UnionIntersection, and Difference</A></DL><DT>bound<DD><A NAME="tex2html173" HREF="page112.html#4298">Abstract Data Types</A><DT>branch-and-bound<DD><A NAME="tex2html804" HREF="page445.html#32604">Branch-and-Bound Solvers</A><DT>breadth-first spanning tree<DD><A NAME="tex2html1061" HREF="page574.html#52495">Constructing Spanning Trees</A><DT>breadth-first traversal<DD><A NAME="tex2html260" HREF="page156.html#6740">Applications</A>, <A NAME="tex2html268" HREF="page156.html#7037">Applications</A>, <A NAME="tex2html474" HREF="page262.html#15272">Breadth-First Traversal</A>, <A NAME="tex2html794" HREF="page440.html#32439">Example-Balancing Scales</A>, <A NAME="tex2html1021" HREF="page552.html#50229">Breadth-First Traversal</A><DT>brute-force algorithms<DD><A NAME="tex2html782" HREF="page434.html#32120">Brute-Force and Greedy Algorithms</A><DT>bubble sort<DD><A NAME="tex2html894" HREF="page489.html#35168">Bubble Sort</A><DT>bucket sort<DD><A NAME="tex2html103" HREF="page76.html#2303">Example-Bucket Sort</A><DT>buckets<DD><A NAME="tex2html105" HREF="page76.html#2314">Example-Bucket Sort</A><DT>built-in scope<DD><A NAME="tex2html1109" HREF="page589.html#56883">Scopes and Namespaces</A><DT>C++ programming language<DD><A NAME="tex2html156" HREF="page112.html#4262">Abstract Data Types</A><DT>carry<DD><A NAME="tex2html660" HREF="page378.html#27000">Merging Binomial Queues</A><DT>ceiling function<DD><A NAME="tex2html25" HREF="page46.html#631">About Harmonic Numbers</A><DT>central limit theorem<DD><A NAME="tex2html865" HREF="page476.html#34244">Exercises</A><DT>chained scatter table<DD><A NAME="tex2html392" HREF="page231.html#11412">Chained Scatter Table</A><DT>child<DD><A NAME="tex2html264" HREF="page156.html#6749">Applications</A>, <A NAME="tex2html427" HREF="page253.html#14453">Terminology</A><DT>circular list<DD><A NAME="tex2html138" HREF="page97.html#3460">Singly-Linked Lists</A>, <A NAME="tex2html283" HREF="page165.html#8184">Doubly-Linked and Circular Lists</A><DT>class<DD><A NAME="tex2html1118" HREF="page591.html#56921">Classes</A><DL><DT>abstract<DD><A NAME="tex2html1164" HREF="page605.html#57407">Algorithmic Abstraction</A><DT>classic<DD><A NAME="tex2html196" HREF="page115.html#4378">Abstract Objects and the </A>, <A NAME="tex2html1149" HREF="page600.html#57157">Derivation and Inheritance</A><DT>classic<DD><A NAME="tex2html196" HREF="page115.html#4378">Abstract Objects and the </A>, <A NAME="tex2html1149" HREF="page600.html#57157">Derivation and Inheritance</A><DT>new-style<DD><A NAME="tex2html194" HREF="page115.html#4376">Abstract Objects and the </A>, <A NAME="tex2html1151" HREF="page600.html#57160">Derivation and Inheritance</A><DT>new-style<DD><A NAME="tex2html194" HREF="page115.html#4376">Abstract Objects and the </A>, <A NAME="tex2html1151" HREF="page600.html#57160">Derivation and Inheritance</A></DL><DT>class attribute<DD><A NAME="tex2html1120" HREF="page592.html#56933">InstancesInstance Attributes and </A><DT>classic class<DD><A NAME="tex2html195" HREF="page115.html#4377">Abstract Objects and the </A>, <A NAME="tex2html1148" HREF="page600.html#57156">Derivation and Inheritance</A><DT>clock frequency<DD><A NAME="tex2html32" HREF="page49.html#862">A Simplified Model of </A><DT>clock period<DD><A NAME="tex2html31" HREF="page49.html#861">A Simplified Model of </A><DT>coalesce<DD><A NAME="tex2html393" HREF="page231.html#11799">Chained Scatter Table</A><DT>cocktail shaker sort<DD><A NAME="tex2html953" HREF="page517.html#47510">Exercises</A><DT>coefficient<DD><DL><DT>binomial<DD><A NAME="tex2html646" HREF="page369.html#26544">Binomial Trees</A></DL><DT>collapsing find<DD><A NAME="tex2html733" HREF="page409.html#29298">Collapsing Find</A><DT>column-major order<DD><A NAME="tex2html155" HREF="page109.html#4056">Exercises</A><DT>commensurate<DD><DL><DT>elements<DD><A NAME="tex2html320" HREF="page190.html#9807">Sorted Lists</A>, <A NAME="tex2html867" HREF="page479.html#34351">Basics</A><DT>elements<DD><A NAME="tex2html320" HREF="page190.html#9807">Sorted Lists</A>, <A NAME="tex2html867" HREF="page479.html#34351">Basics</A><DT>functions<DD><A NAME="tex2html64" HREF="page66.html#1689">More Big Oh Fallacies </A>, <A NAME="tex2html65" HREF="page66.html#1684">More Big Oh Fallacies </A><DT>functions<DD><A NAME="tex2html64" HREF="page66.html#1689">More Big Oh Fallacies </A>, <A NAME="tex2html65" HREF="page66.html#1684">More Big Oh Fallacies </A></DL><DT>compact<DD><A NAME="tex2html772" HREF="page426.html#30963">The Fragmentation Problem</A><DT>compaction<DD><A NAME="tex2html778" HREF="page429.html#31417">Mark-and-Compact Garbage Collection</A><DT>complement<DD><A NAME="tex2html749" HREF="page413.html#29595">Exercises</A><DT>complete <I>N</I>-ary tree<DD><A NAME="tex2html618" HREF="page355.html#23703">Complete <I>N</I>-ary Trees</A><DT>complete binary tree<DD><A NAME="tex2html613" HREF="page354.html#23458">Complete Trees</A>, <A NAME="tex2html918" HREF="page500.html#39076">Sorting with a Heap</A><DT>complex numbers<DD><A NAME="tex2html1125" HREF="page593.html#56943">Example-Complex Numbers</A>
12345

page611.html - 源码说明

本页面展示了「Data Structures And Algorithms With Object-Oriented Design Patterns In Python (2003) source code and」中的 page611.html 源码文件，采用 HTML 编程语言编写，共 601 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与Object-Oriented相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?