Flashcards : Fundamentals of Algorithms and Data Structures — 24 cartes

Finite sequence of elementary operations solving a problem.

Language-independent; describes *what* to do, not *how*.

Sequence of instructions executed by hardware to perform tasks.

Measures time or resources needed, based on input size.

Binary search, sequential search, etc.

Arrange data in a specific order based on keys.

Organize and store data efficiently for algorithms.

LIFO: Last-In-First-Out.

FIFO: First-In-First-Out.

Nodes with data and pointer to next node.

At most two children per node.

Adjacency matrix or adjacency list.

Maps keys to table indices for quick access.

Two keys hash to the same index.

Store colliding elements in linked lists at each slot.

Find alternative slot via probing methods.

Uses two hash functions for probe sequences.

Big O notation describes growth rate.

Maximum time for any input of size n.

O(n): linear in number of elements.

Elementary, stable, in-place, quadratic time.

Unique attribute used for identification or sorting.

Additional info linked to the key, not used for sorting.

Contiguous memory, fast access, fixed size.