CC104: Linear Data Structures - Arrays and Implementation

Vocabulary practice flashcards covering fundamental array concepts, dimensions, time complexities, and basic array operations from CC104.

List

An ordered set of a variable number of elements to which additions and deletions may be made.

Linear List

A finite sequence of simple data, items, or records displaying physical adjacency, where except for the first and last elements, each element has a single successor and a single predecessor.

Array

A fundamental data structure that allows storing an ordered collection of data items of the same type, referred to collectively by a single name.

Array Element

Each individual item stored in an array, also referred to as a subscripted variable.

Array Index

A numerical location identifier assigned to each element in an array, starting at index 0.

Array Dimensionality

The property of an array that is determined by its total number of subscripts.

Traverse Operation

An array operation that visits and prints all array elements one by one, with a time complexity of $O(n)$.

Insertion Operation

An array operation that adds one or more data elements at a given index, requiring element shifting and yielding an average/worst-case time complexity of $O(n)$.

Deletion Operation

An array operation that removes an existing element at a specified position and reorganizes the remaining elements by shifting them to the left, yielding an average/worst-case time complexity of $O(n)$.

Search Operation

An array operation that locates an element using its given index or value, running with an average and worst-case time complexity of $O(n)$.

Update Operation

An array operation that updates an existing element at a given index, running in constant time $O(1)$.

Copying an Array

The process of copying elements from a source array to a target array, operating with a time complexity of $O(n)$.

Merging Two One-Dimensional Arrays

Combining two sorted arrays into a third array large enough to contain all elements in sorted order, with a time complexity of $O(n_1 + n_2)$.

Splitting an Array

Dividing the elements of an array into separate target arrays based on designated conditions, operating with a time complexity of $O(n)$.