Kapitel 5 Flashcards
Bottom-up methodology
progresses from the specific to the general.
Primitive
A building block established by computer science from which algorithm representations can be constructed.
Big theta notation
a way to classify the effectiveness of algorithms. Big theta of n squared = slow. Big theta of log n = fast, good.
Sequential search
sequentially checking of each element of a list until a match is found.
Foot in the door
Att inse att man har kunskap som man kan använda för att lösa resten av problemet
Stepwise refinement
The technique of not trying to conquer an entire task (in all its detail) at once. Rather, stepwise refinement proposes that one first view the problem at hand in terms of steps, each of which is easier to solve than the entire original problem. In turn stepwise refinement proposes that these steps be decomposed into smaller steps and these smaller steps be broken into still smaller ones until the entire problem has been reduced to a collection of easily solved subproblems.
Iterative structures
a collection of instructions is repeated In a looping manner.
Recursive structures
Whereas a loop involves repeating a set of instructions in a manner in which the set is completed and then repeated, recursion involves repeating the set of instructions as a subtask of itself.
Binary search
To repeatedly divide a list for example into two smaller pieces in such a way that the remaining search can be restricted to only one of these pieces.A divide-by-two approach known as the binary search.
Top-down-methodology
progresses from the general to the specific.
Algorithm
AN algorithm is an ordered set of unambiguous, executable steps that defines a terminating process
Polyas four problem solving phases
– 1. Understand the problem. 2. Devise a plan for solving the problem. 3. Carry out the plan. 4. Evaluate the solution for accuracy and for its potential as a tool for solving other problems.
