a generic, step-by-step list of instructions for solving a problem
+refers to when an algorithm performs between its worst and best case given a certain data set or circumstance
+refers to when an algorithm performs especially good given a certain data set or circumstance
+another term for order of magnitude; written as
+technique that tries to exhaust all possibilities of a problem
+A hash operation used to check if a table contains a specific element.
+adjacent or next to
+able to change size automatically
+function represented as a number being raised to a power that increases like
+A hash operation used to retrieve the information associated with a hash key.
+a collection consisting of key-value pairs with an associated hash function that maps the key to the associated value.
+function that grows in a one to one relationship with its input like
+functions that are the inverse of exponential functions usually presented as
+function describing the part that increases the fastest as the value of n increases (a function describing an algorithm's steps as the size of the problem increases).
+function describing a relationship who's highest order is a number squared
+simplified:
complex:
@@ -99,19 +101,19 @@<c classes="code">set_item</c> -A hash operation used to add an item to your table.
+
set_item A hash operation used to add an item to your table.vector -sequence container storing data of a single type that is stored in a dynamically allocated array which can change in size.
+
vector sequence container storing data of a single type that is stored in a dynamically allocated array which can change in size.diff --git a/pretext/Graphs/Glossary.ptx b/pretext/Graphs/Glossary.ptx index 560e917c..a384c2f4 100755 --- a/pretext/Graphs/Glossary.ptx +++ b/pretext/Graphs/Glossary.ptx @@ -5,139 +5,139 @@ worst case -refers to when an algorithm performs especially poorly given a certain data set or circumstance
+
worst case refers to when an algorithm performs especially poorly given a certain data set or circumstanceacyclic graph -A graph with no cycles
+
acyclic graph A graph with no cyclesadjacency list -A list implementation where we keep a master list of all the vertices in the Graph object and then each vertex object in the graph maintains a list of the other vertices that it is connected to
+
adjacency list A list implementation where we keep a master list of all the vertices in the Graph object and then each vertex object in the graph maintains a list of the other vertices that it is connected toadjacency matrix -A matrix implementation where each of the rows and columns represent a vertex in the graph, and where if two vertices are connected by an edge, they are considered adjacent.
+
adjacency matrix A matrix implementation where each of the rows and columns represent a vertex in the graph, and where if two vertices are connected by an edge, they are considered adjacent.adjacent -When two vertices are connected by an edge.
+
adjacent When two vertices are connected by an edge.breadth first search (BFS) -A search that proceeds to look through the edges in a graph to find all the vertices in that graph for which there is a path from the starting point.
+
breadth first search A search that proceeds to look through the edges in a graph to find all the vertices in that graph for which there is a path from the starting point.cycle -A cycle in a directed graph is a path that starts and ends at the same vertex.
+
cycle A cycle in a directed graph is a path that starts and ends at the same vertex.cyclic graph -A graph with at least one cycle in it.
+
cyclic graph A graph with at least one cycle in it.depth first forest -The result of the groups of trees produced by a depth first search algorithm.
+
depth first forest The result of the groups of trees produced by a depth first search algorithm.depth first search (DFS) -A search type where the goal is to create the deepest depth first tree, without any branches.
+
depth first search A search type where the goal is to create the deepest depth first tree, without any branches.digraph -see directed graph
+
digraph see directed graphdirected acyclic graph (DAG) -A directed acyclic graph, which is a directed graph with no cycles.
+
directed acyclic graph A directed acyclic graph, which is a directed graph with no cycles.directed graph -A graph in which all the edges are one-way.
+
directed graph A graph in which all the edges are one-way.edge cost -The weight associated with an arc in a graph.
+
edge cost The weight associated with an arc in a graph.edge -An edge (also called an
+arc) connects two vertices to show that there is a relationship between them. Edges may be one-way or two-way.
edge An edge (also called anarc) connects two vertices to show that there is a relationship between them. Edges may be one-way or two-way.parenthesis property -All the children of a particular node in the depth first tree have a later discovery time and an earlier finish time than their parent.
+
parenthesis property All the children of a particular node in the depth first tree have a later discovery time and an earlier finish time than their parent.path -A path in a graph is a sequence of vertices that are connected by edges.
+
path A path in a graph is a sequence of vertices that are connected by edges.shortest path -The most succinct passage from one edge to another.
+
shortest path The most succinct passage from one edge to another.spanning tree -An acyclic subset of edges that connects all the vertices.
+
spanning tree An acyclic subset of edges that connects all the vertices.strongly connected components (SCC) -The largest subset of vertices C⊂V such that for every pair of vertices v,w∈C we have a path from v to w and a path from w to v.
+
strongly connected components The largest subset of vertices C⊂V such that for every pair of vertices v,w∈C we have a path from v to w and a path from w to v.topological sorting -A topological sort takes a directed acyclic graph and produces a linear ordering of all its vertices such that if the graph G contains an edge (v,w) then the vertex v comes before the vertex w in the ordering.
+
topological sorting A topological sort takes a directed acyclic graph and produces a linear ordering of all its vertices such that if the graph G contains an edge (v,w) then the vertex v comes before the vertex w in the ordering.uncontrolled flooding -Each message starts with a time to live (
+ttl ) value set to some number greater than or equal to the number of edges between the broadcast host and its most distant listener. Each router gets a copy of the message and passes the message on to all of its neighboring routers. When the message is passed on thettl is decreased. Each router continues to send copies of the message to all its neighbors until thettl value reaches 0.
controlled flooding Each message starts with a time to live (ttl ) value set to some number greater than or equal to the number of edges between the broadcast host and its most distant listener. Each router gets a copy of the message and passes the message on to all of its neighboring routers. When the message is passed on thettl is decreased. Each router continues to send copies of the message to all its neighbors until thettl value reaches 0.vertex -A vertex (also called a
+node) is a fundamental part of a graph. It can have a name (also called aKey). A vertex may also have additional information also called a (payload).
vertex A vertex (also called anode) is a fundamental part of a graph. It can have a name (also called aKey). A vertex may also have additional information also called a (payload).diff --git a/pretext/Introduction/Glossary.ptx b/pretext/Introduction/Glossary.ptx index ad2d74bf..11460a8b 100644 --- a/pretext/Introduction/Glossary.ptx +++ b/pretext/Introduction/Glossary.ptx @@ -5,404 +5,404 @@ weight -Shows that there is a cost to go from one vertex to another
+
weight Shows that there is a cost to go from one vertex to anotherabstract data type/ADT -A mathematical model for data.
+
abstract data type/ADT A mathematical model for data.abstraction -Focusing on desired behaviors and properties while disregarding what is irrelevant/unimportant
+
abstraction Focusing on desired behaviors and properties while disregarding what is irrelevant/unimportant access keywords -Keywords such as ‘'public'', private'', and ‘'protected'' that indicates what class properties/behaviors a user can change
+
access keywords Keywords such as ‘'public'', private'', and ‘'protected'' that indicates what class properties/behaviors a user can changeaddress-of -The address-of operator (
+& ) is used to access the address of a C++ variable.
address-of The address-of operator (& ) is used to access the address of a C++ variable.algorithm -A set of instructions or rules given to complete a task.
+
algorithm A set of instructions or rules given to complete a task.<c>AND</c> -A primitive logic gate. In this gate, both A AND B must be true in order to be true.
+
AND A primitive logic gate. In this gate, both A AND B must be true in order to be true.argument -Data passed to a parameter.
+
argument Data passed to a parameter.array -A data structure consisting of an ordered collection of data elements of identical type in which each element can be identified by an array index.
+
array A data structure consisting of an ordered collection of data elements of identical type in which each element can be identified by an array index.array parameters -Used to pass an array of arguments.
+
array parameters Used to pass an array of arguments.atomic data type -Basic data type that cannot be broken down into any simpler data elements.
+
atomic data type Basic data type that cannot be broken down into any simpler data elements.base class -A class from which other classes are derived.
+
base class A class from which other classes are derived.<c>bool</c> -Keyword for Boolean data type.
+
bool Keyword for Boolean data type.<c>char</c> -Keyword for character data type that stores a single character.
+
char Keyword for character data type that stores a single character.class -A template for creating (instantiating) objects, for providing initial values for state via member variables, and for implementations of behavior via member functions or methods
+
class A template for creating (instantiating) objects, for providing initial values for state via member variables, and for implementations of behavior via member functions or methodsclass methods -The functions and methods that belong to a class that describe what the class can do.
+
methods The functions and methods that belong to a class that describe what the class can do.collection -A grouping of a number of data items (possibly only zero or one) that have some shared significance or need to be operated upon together.
+
collection A grouping of a number of data items (possibly only zero or one) that have some shared significance or need to be operated upon together.compiler -A program that converts high-level language into machine language.
+
compiler A program that converts high-level language into machine language.computable -The capability of being copmuted or solved.
+
computable The capability of being copmuted or solved.<c>const</c> -Keyword that makes a variable or value immutable. i.e. constant and unchanging.
+
const Keyword that makes a variable or value immutable. i.e. constant and unchanging.constructor -A class' special function that initializes an object of that class.
+
constructor A class' special function that initializes an object of that class.data abstraction -The act of only providing essential information within your work. Representing your data without reavling the details.
+
data abstraction The act of only providing essential information within your work. Representing your data without reavling the details.data structure -The organization of data that allows for improved search, storage, and sorting capability.
+
data structures The organization of data that allows for improved search, storage, and sorting capability.data types -A classification of various types of data, such as floating-point, integer, or Boolean, the possible values for that type, operations that can be done on that type, +
data types A classification of various types of data, such as floating-point, integer, or Boolean, the possible values for that type, operations that can be done on that type, and how the values of that type are stored.dereference -Follow a pointer to its referenced memory location and read the data there.
+
dereference Follow a pointer to its referenced memory location and read the data there.derived class -A derived class is a class created or derived from another existing class.
+
derived class A derived class is a class created or derived from another existing class.<c>double</c> -Keyword for double-precision floating point data type.
+
double Keyword for double-precision floating point data type.encapsulation -Hiding the contents of a class except when absolutely necessary
+
encapsulation Hiding the contents of a class except when absolutely necessary<c>float</c> -Keyword for floating point data type.
+
float Keyword for floating point data type.friend -An operator or function that can access the private data members of a class of which it is designated as a friend.
+
friend An operator or function that can access the private data members of a class of which it is designated as a friend.friend function -A function defined outside that class' scope but has access to private and protected members of the class
+
friend function A function defined outside that class' scope but has access to private and protected members of the classfunction -A section of code that performs a procedure and is usually named.
+
function A section of code that performs a procedure and is usually named.function overloading -Function overloading is the ability to create multiple functions of the same name with different implementations.
+
function overloading Function overloading is the ability to create multiple functions of the same name with different implementations.HAS-A Relationship -A relationship where one object
+belongs toanother object, and behaves according to rules of ownership.
HAS-A Relationship A relationship where one objectbelongs toanother object, and behaves according to rules of ownership.hash table -A collection consisting of key-value pairs with an associated hash function that maps the key to the associated value.
+
hash table A collection consisting of key-value pairs with an associated hash function that maps the key to the associated value.immutable -Unable to be modified.
+
immutable Unable to be modified.information hiding -Hiding information so that it is invisible from the outside of an object.
+
information hiding Hiding information so that it is invisible from the outside of an object.inheritance -Sharing/gaining the same behavior as another class
+
inheritance Sharing/gaining the same behavior as another classinheritance hierarchy -A singly rooted tree structure.
+
inheritance hierarchy A singly rooted tree structure.instance -An occurrence of an object
+
instance An occurrence of an object<c>int</c> -Keyword for integer data type.
+
int Keyword for integer data type.<c>int main()</c> -The main function used to call all other functions.
+
int main The main function used to call all other functions.interface -A shared boundary in which two or more components of a computer system exchange information.
+
interface A shared boundary in which two or more components of a computer system exchange information.machine code -Instructions and data understandable by a computer's CPU.
+
machine code Instructions and data understandable by a computer's CPU.mutability -Able to be modified.
+
mutability Able to be modified.<c>NOT</c> -An inverter, used to negate input.
+
NOT An inverter, used to negate input.object -A variable, data structure, function, or a method, that can be referenced by an identifier.
+
object A variable, data structure, function, or a method, that can be referenced by an identifier.object attribute -A property of an object that describes what it
+looks like
object attribute A property of an object that describes what itlooks likeobject-oriented programming language -Programming language that uses objects to represent data and methods such as C++ and Java
+
object-oriented programming Programming language that uses objects to represent data and methods such as C++ and Javaoperator overloading -Same as function overloading.
+
operator overloading Same as function overloading.<c>OR</c> -A basic gate. If either input is true, the output is also. If inputs are false, so is the output.
+
OR A basic gate. If either input is true, the output is also. If inputs are false, so is the output.overloading -Specifying more than one definition for the same function name or the same operator within the same scope.
+
overloading Specifying more than one definition for the same function name or the same operator within the same scope.parameter -A variable in a function or method definition that accepts data passed from an argument.
+
parameter A variable in a function or method definition that accepts data passed from an argument.pass by reference -To pass an object to a function by referencing its location in memory.
+
pass by reference To pass an object to a function by referencing its location in memory.pass by value -To pass an object to a function by copying its value.
+
pass by value To pass an object to a function by copying its value.programming -The use of logic to create specified computing operations.
+
programming The use of logic to create specified computing operations.pointer -A variable that stores and manipulates memory addresses.
+
pointer A variable that stores and manipulates memory addresses.polymorphism -The ability to process objects or methods differently depending on their data type, class, number of arguments, etc.
+
polymorphism The ability to process objects or methods differently depending on their data type, class, number of arguments, etc.reference -A value that indicates a place in a computer's memory.
+
reference A value that indicates a place in a computer's memory.set -An unordered data structure consisting of unique, immutable data values.
+
set An unordered data structure consisting of unique, immutable data values.string -A sequential data structure consisting of zero or more characters.
+
string A sequential data structure consisting of zero or more characters.subclasses -A division of an existing class.
+
subclasses A division of an existing class.superclass -A class that has been extended by another existing class.
+
superclass A class that has been extended by another existing class.truth table -A mathematical table used to visually represent boolean logic and functions.
+
truth table A mathematical table used to visually represent boolean logic and functions.unordered set -A container that is not sorted or ordered in any secific way.
+
unordered set A container that is not sorted or ordered in any secific way.vector -Sequence container storing data of a single type that is stored in a dynamically allocated array which can change in size.
+
vector Sequence container storing data of a single type that is stored in a dynamically allocated array which can change in size.<c>void</c> -Keyword indicating a function has no return value.
+
void Keyword indicating a function has no return value.diff --git a/pretext/LinearBasic/Glossary.ptx b/pretext/LinearBasic/Glossary.ptx index 8f5b0b03..b93c68af 100755 --- a/pretext/LinearBasic/Glossary.ptx +++ b/pretext/LinearBasic/Glossary.ptx @@ -5,91 +5,91 @@ word -Unit of data used by a particular processor design.
+
word Unit of data used by a particular processor design.algorithm -a generic, step-by-step list of instructions for solving a problem
+
algorithm a generic, step-by-step list of instructions for solving a problembalanced parentheses -each opening symbol has a corresponding closing symbol and the pairs of parentheses are properly nested
+
balanced parentheses each opening symbol has a corresponding closing symbol and the pairs of parentheses are properly nesteddeque -an ordered collection of items with two ends and the items remain positioned in the collection. New items can be added at either the front or the rear
+
deque an ordered collection of items with two ends and the items remain positioned in the collection. New items can be added at either the front or the rearfirst-in first-out (FIFO) -ordering principle in which the first item added is also the first removed
+
first-in first-out ordering principle in which the first item added is also the first removedfully parenthesized -the usage of one pair of parentheses for each operator
+
fully parenthesized the usage of one pair of parentheses for each operatorinfix -expression notation in which the operator is in between the two operands that it is working on
+
infix expression notation in which the operator is in between the two operands that it is working onlast-in first-out (LIFO) -ordering principle in which the last item added is also the first removed
+
last-in first-out ordering principle in which the last item added is also the first removedlinear data structure -a data structure with elements that have positions relative to each other
+
linear datas a data structure with elements that have positions relative to each otherpalindrome -a string that reads the same forward and backward
+
palindrome a string that reads the same forward and backwardpostfix -expression notation in which all operators come after the two operands that they work on
+
postfix expression notation in which all operators come after the two operands that they work onprecedence -hierarchy on the order things occur
+
precedence hierarchy on the order things occurprefix -expression notation in which all operators precede the two operands that they work on
+
prefix expression notation in which all operators precede the two operands that they work onqueue -an ordered collection of items where the addition of new items happens at one end and the removal of existing items occurs at the other end
+
queue an ordered collection of items where the addition of new items happens at one end and the removal of existing items occurs at the other endsimulation -an imitation of a process or operations
+
simulation an imitation of a process or operationsdiff --git a/pretext/LinearLinked/Glossary.ptx b/pretext/LinearLinked/Glossary.ptx index d7ce4542..baefb7b8 100755 --- a/pretext/LinearLinked/Glossary.ptx +++ b/pretext/LinearLinked/Glossary.ptx @@ -5,62 +5,62 @@ stack -an ordered collection of items where the addition of new items and the removal of existing items always takes place at the same end
+
stack an ordered collection of items where the addition of new items and the removal of existing items always takes place at the same endforward list -a list that is a singly-linked (only links to one other element) sequence container
+
forward list a list that is a singly-linked (only links to one other element) sequence containerhead -the first item in a linked list
+
head the first item in a linked listlinked data structure -a data structure which consists of a set of data structures called nodes +
linked data structure a data structure which consists of a set of data structures called nodes which are linked together and organized by links created via references or pointerslinked list -a linear collection of data elements whose order is not determined by the placement in memory
+
linked list a linear collection of data elements whose order is not determined by the placement in memorylinked list traversal -the process of systematically visiting each node in a linked list
+
linked list traversal the process of systematically visiting each node in a linked listlist -a doubly-linked (links to 2 other elements) container
+
list a doubly-linked (links to 2 other elements) containernode -the element of a linked list.
+
node the element of a linked list.ordered linked list -a linked list whose elements are in an order
+
ordered linked list a linked list whose elements are in an orderordered list -a list whose elements are ordered
+
ordered list a list whose elements are ordereddiff --git a/pretext/Recursion/Glossary.ptx b/pretext/Recursion/Glossary.ptx index 20075a2f..55425c15 100755 --- a/pretext/Recursion/Glossary.ptx +++ b/pretext/Recursion/Glossary.ptx @@ -5,54 +5,54 @@ unordered linked list -a linked list whose elements are not in an order
+
unordered linked list a linked list whose elements are not in an orderbase case -A branch of the conditional statement in a recursive function that does +
base case A branch of the conditional statement in a recursive function that does not give rise to further recursive calls.data structure -An organization of data for the purpose of making it easier to use.
+
data structure An organization of data for the purpose of making it easier to use.dynamic programming -a way to solve complex problems by breaking it up, solving the smaller +
dynamic programming a way to solve complex problems by breaking it up, solving the smaller portions, and storing the results to avoid re-calculating them.exception -An error that occurs at runtime.
+
exception An error that occurs at runtime.handle an exception -To prevent an exception from terminating a program by wrapping +
handle an exception To prevent an exception from terminating a program by wrapping the block of code in atry /except construct.immutable data type -A data type which cannot be modified. Assignments to elements or +
immutable data type A data type which cannot be modified. Assignments to elements or slices of immutable types cause a runtime error.infinite recursion -A function that calls itself recursively without ever reaching the base +
infinite recursion A function that calls itself recursively without ever reaching the base case. Eventually, an infinite recursion causes a runtime error.mutable data type -A data type which can be modified. All mutable types are compound +
@@ -60,19 +60,19 @@
mutable data type A data type which can be modified. All mutable types are compound types. Lists and dictionaries (see next chapter) are mutable data types; strings and tuples are not.raise -To cause an exception by using the
+raise statement.
raise To cause an exception by using theraise statement.recursion -The process of calling the function that is already executing.
+
recursion The process of calling the function that is already executing.recursive call -The statement that calls an already executing function. Recursion can +
@@ -80,7 +80,7 @@
recursive call The statement that calls an already executing function. Recursion can even be indirect — functionf can callg which callsh , andh could make a call back tof .recursive definition -A definition which defines something in terms of itself. To be useful +
@@ -89,14 +89,14 @@
recursive definition A definition which defines something in terms of itself. To be useful it must include base cases which are not recursive. In this way it differs from a circular definition. Recursive definitions often provide an elegant way to express complex data structures.stack frame -a stack that contains a
frameor group of data. For a call stack, this +
stack frame a stack that contains aframeor group of data. For a call stack, this would be a function and its arguments.tuple -A data type that contains a sequence of elements of any type, like a +
@@ -104,7 +104,7 @@
tuple A data type that contains a sequence of elements of any type, like a list, but is immutable. Tuples can be used wherever an immutable type is required, such as a key in a dictionary (see next chapter).tuple assignment -An assignment to all of the elements in a tuple using a single +
diff --git a/pretext/SearchHash/Glossary.ptx b/pretext/SearchHash/Glossary.ptx index 1ef1e310..14c949b0 100755 --- a/pretext/SearchHash/Glossary.ptx +++ b/pretext/SearchHash/Glossary.ptx @@ -5,7 +5,7 @@
tuple assignment An assignment to all of the elements in a tuple using a single assignment statement. Tuple assignment occurs in parallel rather than in sequence, making it useful for swapping values.binary search -search method in which one repeatedly divides a sorted data structure in +
@@ -13,34 +13,34 @@
binary search search method in which one repeatedly divides a sorted data structure in half and determines if the item is in one half of it until the item is found or deemed not in the data.chaining -a method of collision resolution in which each slot in a hash table holds +
chaining a method of collision resolution in which each slot in a hash table holds a reference to a collection of itemscollision -a conflict of having two or more items sharing the same slot in a hash +
collision a conflict of having two or more items sharing the same slot in a hash tablecollision resolution -a systematic method for resolving hash table collisions
+
collision resolution a systematic method for resolving hash table collisionsclustering -items being mapped in a hash table near each other because of collisions +
clustering items being mapped in a hash table near each other because of collisions and linear probing resulting in items with collisions being put togetherfolding method -a method for constructing a hash function by dividing the item into +
@@ -49,94 +49,94 @@
folding method a method for constructing a hash function by dividing the item into equally sized pieces and then adding the pieces together to get a hash value. The value is then divided by the size of the hash table and the remainder becomes the slot for that item.hashing -generating a value given an input that can be used to find the input +
hashin generating a value given an input that can be used to find the input by searching for the value.hash function -the mapping between an item and its slot in a hash table
+
hash function the mapping between an item and its slot in a hash tablehash table -a collection of items which are stored in such a away as to make it easy +
hash table a collection of items which are stored in such a away as to make it easy to find themlinear probing -an open addressing technique in which each slot is visited one at a time +
linear probing an open addressing technique in which each slot is visited one at a time systematicallyload factor -Represents how full a hash table is. Its the number of items in a hash +
load factor Represents how full a hash table is. Its the number of items in a hash table divided by the size of the table.map -an associate data type that stores key-data pairs
+
map an associate data type that stores key-data pairsmid-square method -a method for constructing a hash function by squaring the item and +
mid-square method a method for constructing a hash function by squaring the item and then using some portion of the result.open addressing -a collision resolution that tries to find the next open slot/address in +
open addressing a collision resolution that tries to find the next open slot/address in the hash tableperfect hash function -a hash function that maps each item to a unique hash slot
+
perfect hash function a hash function that maps each item to a unique hash slotquadratic probing -a variation of linear probing in which rehashing is done using successive +
quadratic probing a variation of linear probing in which rehashing is done using successive squared valuesrehashing -putting an item into a hash table after a collision
+
rehashing putting an item into a hash table after a collisionsearching -the algorithmic process of finding a particular item in a +
searching the algorithmic process of finding a particular item in a collection of itemssequential search -search method in which one follows the underlying ordering of items in a +
sequential search search method in which one follows the underlying ordering of items in a collection of data to find a specific itemdiff --git a/pretext/Sort/Glossary.ptx b/pretext/Sort/Glossary.ptx index aa4ce50e..6ed08ba4 100755 --- a/pretext/Sort/Glossary.ptx +++ b/pretext/Sort/Glossary.ptx @@ -5,21 +5,21 @@ slot -a position in a hash table
+
slot a position in a hash tablebubble sort -sorting method that makes multiple passes through a collection, comparing +
bubble sort sorting method that makes multiple passes through a collection, comparing adjacent items, and swaps items that are out of ordergap -an increment used to divide a collection into subsets without breaking +
gap an increment used to divide a collection into subsets without breaking apart the collection during a shell sortinsertion sort -sorting method that maintains a sorted and unsorted subset of a +
@@ -27,21 +27,21 @@
insertion sort sorting method that maintains a sorted and unsorted subset of a collection and inserts elements from the unsorted subset into the sorted subsetmedian of three -method of choosing the pivot value for a quick sort by taking the median +
median of three method of choosing the pivot value for a quick sort by taking the median of the first, middle, and last element of a collectionmerge -part of merge sort that takes two smaller sorted subsets and combines +
merge part of merge sort that takes two smaller sorted subsets and combines themmerge sort -sorting method that uses recursion to split a collection in half until +
@@ -49,7 +49,7 @@
merge sort sorting method that uses recursion to split a collection in half until there is one item and then combines the smaller subsets back into larger sorted subsetspartition -process of quick sort that that finds the split point and moves items to +
@@ -57,14 +57,14 @@
partition process of quick sort that that finds the split point and moves items to the appropriate side of the collection, either less than or greater than the pivot valuepivot value -value selected in a collection during quick sort in order to split a +
pivot value value selected in a collection during quick sort in order to split a collectionselection sort -sorting method that makes multiple passes through a collection, taking +
@@ -73,7 +73,7 @@
selection sort sorting method that makes multiple passes through a collection, taking the largest (ascending) or smallest (descending) unsorted element and places it into its correct place by swapping places with the next largest or lowest elementshell sort -sorting method that divides the collection into subsets, sorts the subsets +
@@ -81,26 +81,26 @@
shell sort sorting method that divides the collection into subsets, sorts the subsets individually using insertion sort, then also sorts the combination of the sorted subsets using insertion sortshort bubble -a modified bubble sort that stops if there are no exchanges to do
+
bubble sort a modified bubble sort that stops if there are no exchanges to dosorting -the process of placing elements from a collection in some kind of order
+
sorting the process of placing elements from a collection in some kind of ordersplit point -the position of the pivot value in the sorted collection; used to divide +
split point the position of the pivot value in the sorted collection; used to divide the collection for subsequent calls to quick sortquick sort -sorting method that uses recursion to split a collection in half (without +
diff --git a/pretext/Trees/Glossary.ptx b/pretext/Trees/Glossary.ptx index 32be0541..83e84fee 100755 --- a/pretext/Trees/Glossary.ptx +++ b/pretext/Trees/Glossary.ptx @@ -5,27 +5,27 @@
quick sort sorting method that uses recursion to split a collection in half (without using extra space) and places elements on the proper side of the split pointAVL tree -a binary search tree that automatically makes sure the tree remains +
AVL tree a binary search tree that automatically makes sure the tree remains balanced at all timesbalance factor -the difference between the height of the left and right subtrees of +
balance factor the difference between the height of the left and right subtrees of a nodebinary heap -a complete binary tree that follows heap ordering rules
+
binary heap a complete binary tree that follows heap ordering rulesbinary search tree -a binary tree in which each node has no more than 2 children; node values +
@@ -33,13 +33,13 @@
binary search a binary tree in which each node has no more than 2 children; node values in the left sub-tree are less than the parent while node values in the right sub-tree arebinary tree -a tree with a maximum of two children for each node
+
binary tree a tree with a maximum of two children for each nodebst propery -property of a binary search key in which the keys that are less than +
@@ -47,26 +47,26 @@
bst property property of a binary search key in which the keys that are less than the parent are found in the left subtree and keys that are greater than the parent are found in the right subtreechildren -the nodes that one node leads to
+
children the nodes that one node leads tocomplete binary tree -a tree in which each level has all of its nodes, with the exception of +
complete binary tree a tree in which each level has all of its nodes, with the exception of the bottom leveledge -connects two nodes in a tree; has only one incoming edge
+
edge connects two nodes in a tree; has only one incoming edgeheap order property -property of the heap based on min heap or max heap (i.e. in a min heap, +
@@ -74,114 +74,114 @@
heap order property property of the heap based on min heap or max heap (i.e. in a min heap, every node x with a parent p, the key in p is smaller than or equal to the key in x)height -the maximum level of any node in the tree
+
height the maximum level of any node in the treeinorder -recursive tree traversal in which the left subtree is visited, then the +
inorder recursive tree traversal in which the left subtree is visited, then the root node, followed by the right subtreeleaf node -a node that has no children
+
leaf node a node that has no childrenlevel -the number of edges on the path from the root to the current node
+
level the number of edges on the path from the root to the current nodemax heap -a binary heap in which the largest key is always at the front
+
max heap a binary heap in which the largest key is always at the frontmin heap -a binary heap in which the smallest key is always at the front
+
min heap a binary heap in which the smallest key is always at the frontnode -part of the tree that holds information
+
node part of the tree that holds informationparent -a node that leads to other nodes
+
parent a node that leads to other nodespath -an ordered list of nodes connected by edges
+
path an ordered list of nodes connected by edgespostorder -recursive tree traversal in which the left subtree is visited, then the +
postorder recursive tree traversal in which the left subtree is visited, then the right, followed by the root nodepreorder -recursive tree traversal in which the root node is visited, then the +
preorder recursive tree traversal in which the root node is visited, then the left, followed by the right subtreepriority queue -a queue whose elements have a priority that determines their order
+
priority queue a queue whose elements have a priority that determines their orderroot -the starting point of the tree; has no incoming edges
+
root the starting point of the tree; has no incoming edgesrotation -rotating the parent and children nodes in a subtree to reorganize +
rotation rotating the parent and children nodes in a subtree to reorganize their hierarchysibling -children of the same parent node
+
sibling children of the same parent nodesubtree -a section of a tree
+
subtree a section of a treesuccessor -a node that can replace another node while preserving the binary search +
successor a node that can replace another node while preserving the binary search tree relationships; the next-largest key in the treetree -a hierarchal data structure with a root, branches, and leaves.
+
tree a hierarchal data structure with a root, branches, and leaves.