The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
CD-ROM Installation ● Have an installed sound device configured for use on your system. If you have ever heard sound coming from your machine, this likely has already been done. If not, you will have to acquire and install a sound device, such as Sound Blaster for PCs or the Macintosh standard sound system. Consult your sound device manual and the documentation for your operating system. ● Configure your browser to recognize sound files in an HTML document. In particular, the Netscape Navigator will have to launch an application to play the sound files. If Netscape attempts to save the audio file when you click on a sound link, this means that your sound application has not be properly installed. About the Postscript Lecture Notes All the Lecture Notes are provided in Postscript format as well. To view Postscript files on Unix, use ghostview. Macintosh users: use the program DropPS 1.1.4, by Barebones Software. Windows-95 and NT users: use the program RoPS 32 file:///E|/WEBSITE/INFO/BROWSERS.HTM (3 of 3) [19/1/2003 1:34:07]
Binary Search in Action Binary Search in Action Binary search is a fast algorithm for searching in a sorted array of keys. To look up a name in a telephone book with n names, you start by comparing the name that you want with the middle or (n/2) nd name, say onroe, Marilyn . Regardless of whether what you are looking someone before this middle name ( Dean, James ) or after it ( Presley, Elvis ), after this first comparison you can forever disregard one half of all the names in the book. The number of steps the algorithm takes equals the number of times we can halve n until only one name is left. Thus twenty comparisons suffice to find any name in the million-name Manhattan phone book! The power of binary search and logarithms is one of the most fundamental idea in the analysis of algorithms. This power becomes apparent if we imagine living in a world with only unsorted telephone books. The following animation of the first two stages of binary search is provided for your amusement. The full video tapes are also available. file:///E|/WEBSITE/IMAGES/BINARY/INDEX.HTM (1 of 5) [19/1/2003 1:34:09]
- Page 783 and 784: Index (complete) linear programming
- Page 785 and 786: Index (complete) , , , , , , , math
- Page 787 and 788: Index (complete) modular arithmetic
- Page 789 and 790: Index (complete) normal distributio
- Page 791 and 792: Index (complete) parallel algorithm
- Page 793 and 794: Index (complete) planar subdivision
- Page 795 and 796: Index (complete) proof of correctne
- Page 797 and 798: Index (complete) regular expression
- Page 799 and 800: Index (complete) self-organizing tr
- Page 801 and 802: Index (complete) sine functions sin
- Page 803 and 804: Index (complete) spring embedding h
- Page 805 and 806: Index (complete) Symbol Technologie
- Page 807 and 808: Index (complete) trial division Tri
- Page 809 and 810: Index (complete) VLSI circuit layou
- Page 811 and 812: 1.4.4 Shortest Path 1.4.4 Shortest
- Page 813 and 814: 1.2.5 Constrained and Unconstrained
- Page 815 and 816: 1.6.4 Voronoi Diagrams 1.6.4 Vorono
- Page 817 and 818: 1.4.7 Eulerian Cycle / Chinese Post
- Page 819 and 820: Online Bibliographies Online Biblio
- Page 821 and 822: About the Book -- The Algorithm Des
- Page 823 and 824: Copyright and Disclaimers Copyright
- Page 825 and 826: CD-ROM Installation Installation an
- Page 827 and 828: CD-ROM Installation install a sound
- Page 829 and 830: Thanks! Frank Ruscica file:///E|/WE
- Page 831 and 832: Thanks! Zhong Li Thanks also to Fil
- Page 833: CD-ROM Installation To use the CD-R
- Page 837 and 838: Binary Search in Action file:///E|/
- Page 839 and 840: Binary Search in Action file:///E|/
- Page 841 and 842: Postscript version of the lecture n
- Page 843 and 844: Lecture 1 - analyzing algorithms Ne
- Page 845 and 846: Lecture 1 - analyzing algorithms Yo
- Page 847 and 848: Lecture 1 - analyzing algorithms Th
- Page 849 and 850: Lecture 1 - analyzing algorithms Th
- Page 851 and 852: Lecture 1 - analyzing algorithms is
- Page 853 and 854: Lecture 2 - asymptotic notation How
- Page 855 and 856: Lecture 2 - asymptotic notation Not
- Page 857 and 858: Lecture 2 - asymptotic notation alg
- Page 859 and 860: Lecture 2 - asymptotic notation Sup
- Page 861 and 862: Lecture 2 - asymptotic notation Nex
- Page 863 and 864: Lecture 3 - recurrence relations Is
- Page 865 and 866: Lecture 3 - recurrence relations
- Page 867 and 868: Lecture 3 - recurrence relations Li
- Page 869 and 870: Lecture 3 - recurrence relations Su
- Page 871 and 872: Lecture 3 - recurrence relations A
- Page 873 and 874: Lecture 4 - heapsort Note iteration
- Page 875 and 876: Lecture 4 - heapsort The convex hul
- Page 877 and 878: Lecture 4 - heapsort 1. All leaves
- Page 879 and 880: Lecture 4 - heapsort left = 2i righ
- Page 881 and 882: Lecture 4 - heapsort Since this sum
- Page 883 and 884: Lecture 4 - heapsort Selection sort
Binary Search in Action<br />
Binary Search in Action<br />
Binary search is a fast algorithm for searching in a sorted array of keys. To look up a name in a telephone<br />
book with n names, you start by comparing the name that you want with the middle or (n/2) nd name, say<br />
onroe, Marilyn . Regardless of whether what you are looking someone before this middle name ( Dean,<br />
James ) or after it ( Presley, Elvis ), after this first comparison you can forever disregard one half of all<br />
the names in the book. <strong>The</strong> number of steps the algorithm takes equals the number of times we can halve<br />
n until only one name is left. Thus twenty comparisons suffice to find any name in the million-name<br />
Manhattan phone book! <strong>The</strong> power of binary search and logarithms is one of the most fundamental idea<br />
in the analysis of algorithms. This power becomes apparent if we imagine living in a world with only<br />
unsorted telephone books.<br />
<strong>The</strong> following animation of the first two stages of binary search is provided for your amusement. <strong>The</strong> full<br />
video tapes are also available.<br />
file:///E|/WEBSITE/IMAGES/BINARY/INDEX.HTM (1 of 5) [19/1/2003 1:34:09]
Change language