| A | B |
|---|
| array | a data structure whose elements are accessed by means of index positions |
| component (element) of array | variables for memory locations for an array |
| index (subscript) | relative position of the components in an array |
| range bound error | when a programmer uses an index outside the size (-1)of the array |
| selection sort | a sorting algorithm that sorts the components of an array in either ascending or descending order. This process puts the smallest or largest element in the top position and repeats the process on the remaining array components |
| sequential (linear) search | The process of searching a list by examining the first component and then examining successive components in the order in which they occur. |
| fill value | value to initialize data elements in an array |
| one-dimensional array | can locate each element with a single index position |
| two-dimensional array | multiple references (row and column) for position |
| class template | a special kind of class definition that allows clients to specify the component types of objects of that class |
| vector | a new class with special array features |
| pointer variable | frequently designated as ptr, a pointer variable is a variable that contains the address of a memory location |
| dynamic memory | memory allocated under program control from the heap and accessed by means of pointers |
| heap | an area of computer memory where storage for dynamic memory is available |
| address | an integer value that the computer can use to reference a location |
| destructor | afunction in the class definition that returns dynamic memory to the computer system |
| substrings | given characters in a string |
| matrix | a clas for two dimensional arrays |
| physical size | the length parameter when a function is called |
| logical size | the number of data elements input when the function returns |
