page433.html

来自「Data Structures And Algorithms With Obje」· HTML 代码 · 共 57 行

HTML
57 行
字号 
<HTML><HEAD><TITLE>Algorithmic Patterns and Problem Solvers</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><A NAME="tex2html6154" HREF="page434.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="../icons/next_motif.gif"></A> <A NAME="tex2html6152" HREF="book.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="../icons/up_motif.gif"></A> <A NAME="tex2html6146" HREF="page432.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="../icons/previous_motif.gif"></A>  <A NAME="tex2html6156" HREF="page611.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="../icons/index_motif.gif"></A> <BR><HR><H1><A NAME="SECTION0014000000000000000000">Algorithmic Patterns and Problem Solvers</A></H1><P><A NAME="chapalgorithms">&#160;</A><P>This chapter presents a number of different algorithmic patterns.Each pattern addresses a category of problemsand describes a core solution strategy for that category.Given a problem to be solved,we may find that there are several possible solution strategies.We may also find that only one strategy applies or even that none of them do.A good programmer is one who is proficient at examiningthe problem to be solvedand identifying the appropriate algorithmic technique to use.The following algorithmic patterns are discussed in this chapter:<DL ><DT><STRONG>direct solution strategies</STRONG><DD>	Brute force algorithms and greedy algorithms.    <DT><STRONG>backtracking strategies</STRONG><DD>	Simple backtracking and branch-and-bound algorithms.    <DT><STRONG>top-down solution strategies</STRONG><DD>	Divide-and-conquer algorithms.    <DT><STRONG>bottom-up solution strategies</STRONG><DD>	Dynamic programming.    <DT><STRONG>randomized strategies</STRONG><DD>	Monte Carlo algorithms and simulated annealing.<P> </DL><BR> <HR><UL> <LI> <A NAME="tex2html6157" HREF="page434.html#SECTION0014100000000000000000">Brute-Force and Greedy Algorithms</A><LI> <A NAME="tex2html6158" HREF="page439.html#SECTION0014200000000000000000">Backtracking Algorithms</A><LI> <A NAME="tex2html6159" HREF="page448.html#SECTION0014300000000000000000">Top-Down Algorithms: Divide-and-Conquer</A><LI> <A NAME="tex2html6160" HREF="page458.html#SECTION0014400000000000000000">Bottom-Up Algorithms: Dynamic<BR> Programming</A><LI> <A NAME="tex2html6161" HREF="page464.html#SECTION0014500000000000000000">Randomized Algorithms</A><LI> <A NAME="tex2html6162" HREF="page476.html#SECTION0014600000000000000000">Exercises</A><LI> <A NAME="tex2html6163" HREF="page477.html#SECTION0014700000000000000000">Projects</A></UL><HR><A NAME="tex2html6154" HREF="page434.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="../icons/next_motif.gif"></A> <A NAME="tex2html6152" HREF="book.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="../icons/up_motif.gif"></A> <A NAME="tex2html6146" HREF="page432.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="../icons/previous_motif.gif"></A>  <A NAME="tex2html6156" HREF="page611.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="../icons/index_motif.gif"></A> <P><ADDRESS><img src="../icons/bruno.gif" alt="Bruno" align=right><a href="../copyright.html">Copyright &#169; 2003</a> by <a href="../signature.html">Bruno R. Preiss, P.Eng.</a>  All rights reserved.</ADDRESS></BODY></HTML>

page433.html - 源码说明

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

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

⌨️ 快捷键说明

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