Computer science : chapter 5. Algorithms

Programming language

A collection of Primitives along with a collection of rules stating how The Primitives can be combined to represent more complex ideas

Loop

A collection of instructions is executed in a repetitive fashion under the direction of some Control process

Iterative structures

A collection of instructions is repeated in a looping manner

Pseudocode

A notational system in which ideas can be expressed informally during the algorithm development process

Primitive

A well-defined set of building blocks from which algorithm representations can be constructed

Algorithm

An ordered set of unambiguous comma executable steps that defines a terminating process

Termination condition

Indicates termination should take place

Loop invariant

Insertion at a point in a loop that is true every time that point in the loop is reached

Parameters

Listing of generic names

Top-down methodology

Progresses from the general to the specific

Bottom up methodology

Progresses from the specific to the general

Post-test Loop

Test for termination is performed after the body is executed

Pretest Loop

Test for termination is performed before the body is executed

Preconditions

The assumption that certain conditions are satisfied at the beginning of the program's execution

Recursion

The binary search execute search stage of the repetition as a subtask the previous stage

Big-theta notation

Classification of algorithms according to the shapes for their graphs

Sequential search

Considers entries in a sequential order in which they occur in the list

Binary search

Repeatedly divides the list in question into two smaller pieces in such a way that the remaining search can be restricted to only one of these pieces

Insertion sort

Sort a list by repeatedly removing an entry and inserting it into its proper place

Assertion

Statements that can be established at various points in the program

Stepwise refinement

The technique of not trying to conquer an entire task in all its detail at once. proposes that one first view the problem at hand and terms of several some problems