Chapter 1
A sequence of statements only executed under a certain condition
What is a branch?
A sequence of steps for accomplishing a task
What is an algorithm?
The process of putting a collection of elements into ascending (or descending) order
What is sorting?
A sorting algorithm that treats the input as a collection of interleaved arrays, and sorts each array individually with a variant of the insertion sort algorithm
What is a shell sort?
Defines a new type that can group data and functions to form an object
What is a class construct?
Evaluates to true if the left and right sides are equal
What is the equality operator (==)?
A search algorithm that starts from the beginning of an array, and checks each element until the search key is found or the end of the array is reached
What is a linear search?
A sorting algorithm that iterates through an array, comparing and swapping adjacent elements if the second element is less than the first element
What is bubble sort?
A positive integer representing the distance between elements in an interleaved array
What is a gap value?
Indicate all operations a class user can perform on the object
What is a class public member function?
Checks how one operand's value relates to another, like being greater than
What is a relational operator?
An algorithm for searching a sorted array
What is a binary search?
A sorting algorithm that treats the input as two parts, a sorted part and an unsorted part, and repeatedly selects the minimum value to move from the unsorted part to the end of the sorted part
What is selection sort?
A grouping of data (variables) and operations that can be performed on that data (functions)
What is an object?
Used to invoke a function on an object
What is a member access operator?
Treats operands as being true or false and evaluates to true or false
What is a logical operator? (AND, OR, NOT)
An operation that, for a given processor, always operates in the same amount of time, regardless of input values
What is a constant time operation?
A sorting algorithm that treats the input as two parts, a sorted part and an unsorted part, and repeatedly inserts the next value from the unsorted part into the correct location in the sorted part
What is insertion sort?
Means to have a user interact with an item at a high-level, with lower-level internal details hidden from the user
What is abstraction?
Variables that member functions can access but class users cannot
What are private data members?
Commonly used to make decisions that are based on multiple features
What is a nested if-else statement?
A mathematical way of describing how a function (running time of an algorithm) generally behaves in relation to the input size
What is Big O Notation?
Only contains a few elements not in sorted order
What is a nearly sorted array?
A data type whose creation and update are constrained to specific well-defined operations
What is an abstract data type (ADT)?
Provides a class name, return type, parameter names and types, and the function's statements
What is a function definition?