專業英文導讀
Chapter 8
Key Terms
Key Term
Definition
Page #
Algorithm
An algorithm is an effective method that can be 220
expressed within a finite amount of space and
time and in a well-defined formal language for
calculating a function.
Algorithms exist that perform calculation, data
processing, and automated reasoning.
Binary search
A search algorithm in which the search value is 237
located by repeatedly dividing the list in half.
The binary search is perhaps the most famous
and best suitable search algorithm for sorted
arrays.
Bubble sort
A search algorithm in which each pass through 233
the data moves the lowest element to the
beginning of the unsorted portion of the list.
Bubble sort has many of the same properties as
insertion sort, but has slightly higher overhead.
Decision
Some problem cannot be sequence of 224
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.
Decision constructs allow programs and scripts
to make decisions.
Input data
User information that is submitted to a 220
computer to run a program.
More specifically, we should also note that the
algorithm accepts input data and creates output
data.
Insertion sort
A sort algorithm in which the first element 234
from the unsorted portion of the list is inserted
into its proper position in the sorted portion of
the list.
The insertion sort algorithm is one of the most
1
專業英文導讀
common sorting techniques, and it is often used
by card player.
Loop
In a program, a structured programming 224
construct that causes one or more statements to
be repeated. In a graph, a line that starts and
ends with the same vertex.
In computer programming, a loop is a sequence
of instruction s that is continually repeated
until a certain condition is reached.
Output data
The results of running a computer program.
220
More specifically, we should also note that the
algorithm accepts input data and creates output
data.
Product
The result of multiplying two numbers.
230
Another common algorithm is finding the
product of a list of integers.
Pseudocode
Pseudocode is an
225
informal high-level description of the operating
principle of a computer program or
other algorithm.
Pseudocode is an English-like representation of
an algorithm.
Recursion
A function design in which the function calls 239
itself.
Recursion in computer science is a method
where the solution to a problem depends on
solutions to smaller instances of the same
problem.
repetition
One of the three construct in structural 224
programming.
A repetition construct causes a group of one or
more program statements to be invoked
repeatedly until some end condition is met.
Searching
The process that examines a list to locate one 236
or more elements containing a designated value
known as the search argument.
Another common algorithm in computer
2
專業英文導讀
science is searching, which is the process of
finding the location of a target among a list of
objects.
Selection
One of the three construct in structural 224
programming.
In 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 sort
A sort algorithm in which the smallest value in 232
the unsorted portion of the list is selected and
placed at the end of the sorted portion of the
list.
In a selection sort, the list to be sorted is
divided into two sublistd —sorted and unsorted
– which are separated by an imaginary wall.
Sequence
One of the three construct in structural 224
programming.
The first construct is called the sequence.
Sequential search
An access technique used with a linear list in 236
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.
Sequential search is used if the list to be
searched is not ordered.
Sort pass
One loop during which all elements are tested 232
by a sorting program.
Each time we move one element from the
unsorted sublist to the sorted sublist, we have
completed a sort pass.
Sorting
The process that orders a list or file.
231
One of the most common applications in
computer science is sorting.
Structure chart
A design and documentation tool that 239
represents a program as a hierarchical flow of
functions.
3
專業英文導讀
A structure chart is a top-down modular
design tool, constructed of squares representing
the different modules in the system, and lines
that connect them.
subalgorithm
A part of an algorithm that is independently 238
written and is executed when called inside the
algorithm.
The principles of structured programming,
however, require that an algorithm be broken
into small units called subalgorithms.
Summation
Addition of a series of numbers.
230
One commonly used algorithm in computer
science is summation.
Unified
modeling A graphical character that defines a page on the 225
Internet.
language (UML)
Unified modeling language (UML) is a
pictorial representation of an algorithm.

非課本來源

課本內容
來源:
大多數為 wiki https://www.wikipedia.org/
其他 http://www.webopedia.com/
http://searchwindowsserver.techtarget.com/
4