算法分析大纲.docx

算法的定义An algorithm is a sequence of unambiguous instructions for solving a computational problem, obtaining a required output for any legitimate input in a finite amount of time.算法是一系列解决问题的清晰指令，也就是说，对于符合一定规范的输入，能够在有限时间内获得所要求的输出。算法的特点Finiteness DefinitenessInputOutputEffectiveness算法的设计步骤Understanding the problem. Read the problem description carefully and ask question if you have any doubts about the problems.Deciding on.deciding on appropriate data structures.Designing an algorithm. An algorithm design technique is a general approach to solving problems algorithmically that is applicable to a variety of problems from different areas of computingProving correctness. The notions of correctness of approximation algorithm is less straightforward than it is for exact algorithm.Analyzing an algorithm. Time efficiency indicates how fast the algorithm runs, space efficiency indicates how much extra memory the algorithm needs.Coding the algorithm. Most algorithm are destined to be ultimately implemented as computer programs. Programming an algorithm presents both a peril and an opportunity.算法效率Time efficiencySpace efficiency增长次数比较1 logn n nlogn n2 n3 2的n次方 n！蛮力法定义A straightforward approach, usually based directly on the problem’s statement and definitions of the concepts involved.蛮力法是一种简单直接地解决问题的方法，通常直接基于问题的描述和所涉及的概念定义。蛮力法优缺点Strengths ：1 wide applicability 2 simplicity 3yields reasonable algorithms for some important problems(e.g., matrix multiplication, sorting, searching, string matching) Weaknesses：1 rarely yields efficient algorithms 2some brute-force algorithms are unacceptably slow not as constructive as some other design techniques选择排序和冒泡排序两个算法的比较Selection Sort Bubble Sort 1Stability: Selection Sort is instable ;Bubble Sort is stable2Efficiency:Selection Sort n2；Bubble Sort n23Comparion number: Selection Sort :n(n-1)/2 Bubble Sort: n(n-1)/24input size：n解决背包问题过程和分析W1=7 v1=42 w2=3 v2=12 w3=4 v3=40 w4=5 v4=25 背包W=10子集Subset总重量Total weight总价值 Total value空00{1}7