Www.cs.pu.edu.tw



Chapter 8 Key TermsKey TermDefinitionPage #AlgorithmAn algorithm is an?effective method?that can be expressed within a finite amount of space and time?and in a well-defined formal language?for calculating a?function.220?Algorithms exist that perform?calculation,?data processing, and?automated reasoning.Binary searchA search algorithm in which the search value is located by repeatedly dividing the list in half.237The binary search is perhaps the most famous and best suitable search algorithm for sorted arrays.Bubble sortA search algorithm in which each pass through the data moves the lowest element to the beginning of the unsorted portion of the list.233Bubble sort has many of the same properties as insertion sort, but has slightly higher overhead.DecisionSome problem cannot be sequence of instructions must be repeated. We handle this with the repetition or loop construct. Finding the largest integer among a set of integers can use a construct of this kind.224Decision constructs allow programs and scripts to make decisions.?Input dataUser information that is submitted to a computer to run a program.220More specifically, we should also note that the algorithm accepts input data and creates output data.Insertion sortA sort algorithm in which the first element from the unsorted portion of the list is inserted into its proper position in the sorted portion of the list.234The insertion sort algorithm is one of the most common sorting techniques, and it is often used by card player.LoopIn a program, a structured programming construct that causes one or more statements to be repeated. In a graph, a line that starts and ends with the same vertex.224In computer programming, a loop is a sequence of?instruction?s that is continually repeated until a certain condition is reached.?Output dataThe results of running a computer program.220More specifically, we should also note that the algorithm accepts input data and creates output data.ProductThe result of multiplying two numbers.230Another common algorithm is finding the product of a list of integers.PseudocodePseudocode?is an informal?high-level?description of the operating principle of a?computer program?or other?algorithm.225Pseudocode is an English-like representation of an algorithm.RecursionA function design in which the function calls itself.239Recursion?in?computer science?is a method where the solution to a problem depends on solutions to smaller instances of the same problem.repetitionOne of the three construct in structural programming.224A repetition construct causes a group of one or more program statements to be invoked repeatedly until some end condition is met.SearchingThe process that examines a list to locate one or more elements containing a designated value known as the search argument.236Another common algorithm in computer science is searching, which is the process of finding the location of a target among a list of objects.SelectionOne of the three construct in structural programming.224In a?selection?structure, a question is asked, and depending on the answer, the program takes one of two courses of action, after which the program moves on to the next event.Selection sortA sort algorithm in which the smallest value in the unsorted portion of the list is selected and placed at the end of the sorted portion of the list.232In a selection sort, the list to be sorted is divided into two sublistd —sorted and unsorted – which are separated by an imaginary wall.SequenceOne of the three construct in structural programming.224The first construct is called the sequence.Sequential searchAn access technique used with a linear list in which searching begins at the first element and continues until the value of an element equal to the value being sought is located, or until the end of the list is reached.236Sequential search is used if the list to be searched is not ordered.Sort passOne loop during which all elements are tested by a sorting program.232Each time we move one element from the unsorted sublist to the sorted sublist, we have completed a sort pass.SortingThe process that orders a list or file.231One of the most common applications in computer science is sorting.Structure chartA design and documentation tool that represents a program as a hierarchical flow of functions.239A structure chart is a?top-down modular design?tool, constructed of squares representing the different modules in the system, and lines that connect them.?subalgorithmA part of an algorithm that is independently written and is executed when called inside the algorithm.238The principles of structured programming, however, require that an algorithm be broken into small units called subalgorithms.SummationAddition of a series of numbers.230One commonly used algorithm in computer science is summation.Unified modeling language (UML)A graphical character that defines a page on the Internet.225Unified modeling language (UML) is a pictorial representation of an algorithm.非課本來源課本內容來源: 大多數為wiki 其他 ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download