国外算法设计与分析课件02(免费阅读).pptVIP

Important Problem Types and Fundamental Data Structures Important problems types Sorting, searching, string processing, graph problems Fundamental data structures Linear data structures Stacks, queues, and heaps Graphs Trees Expected Outcomes Student should be able to List the various problem types and their meanings Explain each data structures introduced in the lecture Sorting Rearrange the items of a given list in ascending/descending 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 Examples of sorting algorithms Bubble sort Selection sort Insertion sort Merge sort Quick sort Heap sort … Evaluate sorting algorithm complexity: the number of key comparisons. Two properties Stability: A sorting algorithm is called stable if it preserves the relative order of any two equal elements in its input. In place : A sorting algorithm is in place if it does not require extra memory, except, possibly for a few memory units. Searching Find a given value, called a search key, in a given set. Examples of searching algorithms Sequential searching Binary searching… String Processing A string is a sequence of characters from an alphabet. Text strings: letters, numbers, and special characters. String matching: searching for a given word/pattern in a text. Graph Problems Informal definition A graph is a collection of points called vertices, some of which are connected by line segments called edges. Modeling real-life problems Modeling WWW communication networks Project scheduling … Examples of graph algorithms Graph traversal algorithms Shortest-path algorithms Topological sorting Linear Data Structures Arrays A sequence of n items of the same data type that are stored contiguously in compu