footnode.html
字号:
<HTML><HEAD><TITLE>Footnotes</TITLE></HEAD><BODY bgcolor="#FFFFFF"><DL> <DT><A NAME="178">...monotonicity</A><DD>Don't worry if you don't know what that means.Essentially it says that Python's new-style classes ``do the right thing.''<P><PRE>..............................</PRE><DT><A NAME="666">...102#102.</A><DD>The notation 103#103 denotes the<em>floor function</em><A NAME=629> </A>,which is defined as follows:For any real number <I>x</I>, 104#104 is thegreatest integer less than or equal to <I>x</I>.While we are on the subject,there is a related function,the <em>ceiling function</em><A NAME=631> </A>,written 105#105.For any real number <I>x</I>, 106#106 is thesmallest integer greater than or equal to <I>x</I>.<PRE>..............................</PRE><DT><A NAME="1200">...119#119.</A><DD>In fact, we would normally write 120#120,but we have not yet seen the 1#1 notation which is introducedin Chapter <A HREF="page58.html#chapasymptotic"><IMG ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A>.<PRE>..............................</PRE><DT><A NAME="1758">...rule</A><DD> Guillaume François Antoine de L'Hôpital, marquis de Sainte-Mesme, is known for his rule for computing limits which states that if 357#357 and 358#358, then <P>359#359<P> where <I>f</I>'(<I>n</I>) and <I>g</I>'(<I>n</I>) are the first derivatives with respect to <I>n</I> of <I>f</I>(<I>n</I>) and <I>g</I>(<I>n</I>), respectively. The rule is also effective if 360#360 and 361#361.<PRE>..............................</PRE><DT><A NAME="1761">...commensurate.</A><DD>Functions which are commensurate<A NAME=1689> </A>are functions which can be compared one with the other.<PRE>..............................</PRE><DT><A NAME="2245">...436#436.</A><DD>This notion of the looseness (tightness<A NAME=1908> </A>)of an asymptotic bound is related tobut not exactly the same as that given in Definition <A HREF="page65.html#defntightness"><IMG ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A>.<PRE>..............................</PRE><DT><A NAME="2253">...numbers.</A><DD>Fibonacci numbers are named in honor ofLeonardo Pisano (Leonardo of Pisa),the son of Bonaccio (in Latin, <em>Filius Bonaccii</em>),who discovered the series in 1202.<PRE>..............................</PRE><DT><A NAME="2218">...numbers.</A><DD>These running times were measured on an Intel Pentium III,which has a 1 GHz clock and 256MB RAMunder the Red Hat Linux 7.1 operating system.The programs were executed using the Python version 2.2.3 interpreter.<PRE>..............................</PRE><DT><A NAME="4933">...<tt>object</tt></A><DD>Strictly speaking,this is true only for the so-called``new-style'' Python classes<A NAME=4375> </A><A NAME=4376> </A>which were introduced in Python version 2.2.Support for the so-called``classic'' classes<A NAME=4377> </A><A NAME=4378> </A>,which are not ultimately derived from the <tt>object</tt> class,is being phased out of the Python language.In this book we will use only Python new-style classes.<P><PRE>..............................</PRE><DT><A NAME="4934">...class</A><DD>For a complete list of the methods definedin the <tt>__builtin__</tt><tt>.object</tt> class,you should consult the<em>Python Reference Manual</em>[<A HREF="page610.html#vanrossumref">49</A>].<PRE>..............................</PRE><DT><A NAME="7426">...NAME=7372> </A>.</A><DD>The word <em>deque</em> is usually pronouncedlike ``deck'' and sometimes like ``deek.''<PRE>..............................</PRE><DT><A NAME="9950">...order</em></A><DD>A <em>total order</em> is a relation, say <I><</I>,defined on a set of elements, say 795#795,with the following properties:<OL><LI> For all pairs of elements 796#796, such that 797#797, exactly one of either <I>i</I><I><</I><I>j</I> or <I>j</I><I><</I><I>i</I> holds. (All elements are commensurate<A NAME=9807> </A>).<LI> For all triples 798#798, 799#799. (The relation 394#394 is transitive<A NAME=9808> </A>).</OL><P>(See also Definition <A HREF="page479.html#defntotalorder"><IMG ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A>).<P><PRE>..............................</PRE><DT><A NAME="10685">...<P>822#822<P></A><DD>This is the Swedish word for the number two.The symbol <tt>å</tt>in the <em>Unicode character set</em><A NAME=10564> </A>can be represented in a Python programusing the <em>Unicode escape</em><A NAME=10566> </A>``<tt>u00E5</tt>''.<P><PRE>..............................</PRE><DT><A NAME="10570">...<P>822#822<P></A><DD>I have been advised that a book with out sex will never be a best seller.``Sex'' is the Swedish word for the number six.<P><PRE>..............................</PRE><DT><A NAME="10686">...prime</em></A><DD>Two numbers <I>x</I> and <I>y</I> are<em>relatively prime</em><A NAME=10641> </A><A NAME=10642> </A>if there is no number other than onethat divides both <I>x</I> and <I>y</I> evenly.<PRE>..............................</PRE><DT><A NAME="13245">...<I>i</I>.</A><DD>What else would it be?<PRE>..............................</PRE><DT><A NAME="14665">...NAME=14664> </A>.</A><DD>Isomorphic is a fancy word that meansbeing of identical or similar form or shape or structure.<PRE>..............................</PRE><DT><A NAME="19437">...Landis</A><DD>Russian mathematicians G. M. Adel'son-Vel'skiı and E. M. Landispublished this result in 1962.<PRE>..............................</PRE><DT><A NAME="21047">...trees.</A><DD>Obviously since B-Trees are <I>M</I>-way trees,the ``B'' in <em>B-Tree</em> does not stand for <em>binary</em>.B-Trees were invented by R. Bayer and E. McCright in 1972,so the ``B'' either stands for <em>balanced</em>or <em>Bayer</em>-take your pick.<PRE>..............................</PRE><DT><A NAME="26707">...HREF="page384.html#exercisepqueuesbinom"><IMG ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A>).</A><DD>Isaac Newton<A NAME=26548> </A> discovered the binomial theorem in 1676but did not publish a proof.Leonhard Euler<A NAME=26549> </A> attempted a proof in 1774.Karl Friedrich Gauss<A NAME=26550> </A>produced the first correct proof in 1812.<PRE>..............................</PRE><DT><A NAME="28256">...subsets.</A><DD><em>Stirling numbers of the second kind</em><A NAME=28128> </A>are given by the formula<P>1609#1609<P>where <I>n</I><I>></I>0 and 1610#1610.<P><PRE>..............................</PRE><DT><A NAME="29828">...<em>explicitly</em></A><DD>Note: The Python <tt>del</tt> operator does not destroy objects-it removes the binding for a name from a namespace.That is, <tt>del</tt> disassociates a name from an objectbut leave the object itself intact.<P><PRE>..............................</PRE><DT><A NAME="30692">...structures.</A><DD>Mark-and-sweep garbage collection is described by John McCarthyin a paper on the LISP language published in 1960.<PRE>..............................</PRE><DT><A NAME="33426">...space.</A><DD>The reader may find it instructive to compareProgram <A HREF="page443.html#progdepthFirstSolvera"><IMG ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A> with Program <A HREF="page267.html#progtreea"><IMG ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A>and Program <A HREF="page550.html#proggraphd"><IMG ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A>.<PRE>..............................</PRE><DT><A NAME="33431">...space.</A><DD>The reader may find it instructive to compareProgram <A HREF="page444.html#progbreadthFirstSolvera"><IMG ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A> with Program <A HREF="page269.html#progtreeb"><IMG ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A>and Program <A HREF="page553.html#proggraphe"><IMG ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A>.<PRE>..............................</PRE><DT><A NAME="33459">...NAME=33205> </A>.</A><DD>The table is named in honor of <em>Blaise Pascal</em><A NAME=33207> </A>who published a treatise on the subject in 1653.<PRE>..............................</PRE><DT><A NAME="33980">...number!</A><DD>Prime numbers of the form 1905#1905 are known as<em>Mersenne primes</em><A NAME=33786> </A>.<PRE>..............................</PRE><DT><A NAME="33790">...1908#1908.</A><DD>For convenience, we use the notation 1909#1909to denote 1910#1910.<PRE>..............................</PRE><DT><A NAME="35169">...NAME=35168> </A>.</A><DD>Unfortunately, the fame of bubble sort exceeds by far its practical value.<PRE>..............................</PRE><DT><A NAME="37673">...zero.</A><DD>There is also the symmetrical case in which <I>i</I> is always <I>n</I>-1.<PRE>..............................</PRE><DT><A NAME="57490">...(respectively)</A><DD>In this book,the names of instance attributes typically beginwith an underscore ``<tt>_</tt>''.<P><PRE>..............................</PRE> </DL><P><ADDRESS><img src="../icons/bruno.gif" alt="Bruno" align=right><a href="../copyright.html">Copyright © 2003</a> by <a href="../signature.html">Bruno R. Preiss, P.Eng.</a> All rights reserved.<P></ADDRESS></BODY></HTML>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -