Python Arrays, Algorithms, and Sorting Methods

Vocabulary practice flashcards covering Python array operations, type codes, asymptotic notations, divide and conquer strategies, and common sorting algorithms.

Array (Python)

A data structure that can hold more than one value at a time, representing a collection or ordered series of items.

Element

Each individual item stored inside an array, which possesses a numerical index corresponding to its location starting at index zero.

Type Code

Symbols used to define the exact data type and memory size of items stored within an array.

1 Byte

A memory unit consisting of 8 bits that can store up to 256 elements.

2 Bytes

A memory unit consisting of 16 bits that can store up to 65,536 elements.

Signed

A numeric data type representation that permits both negative and positive values.

Unsigned

A numeric data type representation that permits positive values and zero only.

Floating point

A data type representation that includes decimals or fractions.

Typecode 'b'

Represents a signed integer of size 1 byte.

Typecode 'B'

Represents an unsigned integer of size 1 byte.

Typecode 'c'

Represents a character of size 1 byte.

Typecode 'i'

Represents a signed integer of size 2 bytes.

Typecode 'I'

Represents an unsigned integer of size 2 bytes.

Typecode 'f'

Represents a floating point of size 4 bytes.

Typecode 'd'

Represents a floating point of size 8 bytes.

len()

A built-in function used to determine the total number of elements present in an array.

append()

An array operation method used to add a single element to the end of an array.

extend()

An array operation method used to add more than one element to the end of an array.

insert()

An array operation method used to place an element at a specified index position.

pop()

An array operation method used to remove an element from an array while returning its value.

remove()

An array operation method used to permanently delete an element from an array without returning it.

Array Concatenation

The process of combining or joining two separate arrays together into one larger array.

Array Slicing

The operation of taking or extracting a specific portion or range of an array using the colon (:) syntax.

For loop (Array)

A loop structure used to iterate over the items of an array for a specific number of times.

While loop (Array)

A loop structure that continues repeating over an array until a specified condition is satisfied.

NumPy

A Python package used for advanced array operations, installed using PIP.

Algorithm

A well-defined computational procedure that takes some value or set of values as input and produces a corresponding value or set of values as output.

Asymptotic Notations

Mathematical descriptions representing the order of growth of an algorithm's running time to evaluate its performance and efficiency.

THETA ($\Theta$-notation)

Represents the average case and upper bound of an algorithm, guaranteeing the program will never exceed this time limit.

BIG-O (O-notation)

Represents the worst case and lower bound of an algorithm, describing the absolute fastest the program can run under optimal conditions.

OMEGA ($\Omega$-notation)

Represents the best case and exact rate of growth, utilized when best-case and worst-case performance grow at the identical rate.

Divide and Conquer

An algorithmic problem-solving strategy that breaks a complex problem down into smaller, identical sub-problems until they are simple enough to solve directly.

Divide Step

The first step of Divide and Conquer, where the main problem is broken down into smaller sub-problems.

Conquer Step

The second step of Divide and Conquer, where sub-problems are solved recursively or directly if small enough.

Combine Step

The final step of Divide and Conquer, where sub-problem solutions are merged together to obtain the final solution.

Recursion

A programming method wherein a function invokes itself in order to solve a problem.

Selection Sort

A sorting technique that finds the minimum element in the unsorted section of a list and swaps it with the element at the designated position.

Insertion Sort

A sorting technique where items are systematically inserted into a list and immediately organized in proper sequential order.

Bubble Sort

A sorting technique where adjacent elements are iteratively compared and swapped one at a time.

Merge Sort

A divide-and-conquer sorting technique that splits an array into two, then four, then eight parts before arranging and merging them back together.

Heap Sort

A tree-structured sorting algorithm featuring an ancestor root node where each node has up to 2 children, sorted by exchanging values with parent nodes.