算法设计与分析 1基础知识-算法、描述、数据结构.pptVIP

* * * * * * * * * * * * * * * Examples of a simple path and a not simple path. Connected graphs: starting from any vertex, we can always find a path to reach all the other vertices. (Ball-String example.) From NIST: Connected graphs: Definition: An undirected graph that has a path between every pair of vertices. Strongly connected graphs: Definition: A directed graph that has a path from each vertex to every other vertex. Connected component: … Strongly connected component: a strongly connected component of a digraph G is a maximal strongly connected subgraph of G. * * * * * * What can we learn from the previous 3 examples? The same algorithm can be represented in several different ways. (different pseudocode) There might exists more than one algorithm for a certain problem! Algorithms for the same problem can be based on very different ideas and can solve the problem with dramatically different speeds.! * * The Process of Design an Algorithm Formulating the problem with enough mathematical precision we can ask a concrete question start to solve it. Design the algorithm list the “precise” steps. (an expert can translate the algorithm into a computer program.) Analyze the algorithm prove that it is correct establish the efficiency the running time or sometimes space * * Important Problem Types Sorting Searching String processing Graph problems * * Sorting (I) Rearrange the items of a given list in ascending order. Input: A sequence of n numbers a1, a2, …, an Output: A reordering a′1, a′2, …, a′n of the input sequence such that a′1≤ a′2 ≤ … ≤ a′n. Why sorting? Help searching Algorithms often use sorting as a key subroutine. Sorting key A specially chosen piece of information used to guide sorting. I.e., sort student records by names. * * Sorting (II) Examples of sorting algorithms Selection sort Bubble sort Insertion sort Merge sort Quick sort Evaluate sorting algorithm complexity: the number of key comparisons. * * Selection Sort Algori