16 terms in 3.3
Algorithms and complexity
A simple searching algorithm that checks each element sequentially until finding the target or reaching the end. Linear
Fundamentals of algorithms
Algorithms and complexity
An efficient searching algorithm repeatedly dividing sorted search space in half until finding target or determining abs
Fundamentals of algorithms
Algorithms and complexity
The process of arranging elements in ascending or descending order according to defined criteria. Sorting enables binary
Fundamentals of algorithms
Algorithms and complexity
A simple sorting algorithm repeatedly comparing adjacent elements and swapping if out of order, moving larger elements t
Fundamentals of algorithms
Algorithms and complexity
A divide-and-conquer sorting algorithm recursively dividing data in half, sorting each half, then merging sorted halves.
Fundamentals of algorithms
Algorithms and complexity
Mathematical notation describing algorithm performance scaling with input size. Big O expresses upper bounds on time/spa
Fundamentals of algorithms
Algorithms and complexity
Measure of how algorithm runtime grows with input size. Time complexity analysis predicts performance without execution.
Fundamentals of algorithms
Algorithms and complexity
Measure of how algorithm memory usage grows with input size. Space complexity includes auxiliary space (extra memory bey
Fundamentals of algorithms
Algorithms and complexity
Algorithm analysis considers different input scenarios. Best case analyzes optimal inputs; worst case analyzes adversari
Fundamentals of algorithms
Algorithms and complexity
A divide-and-conquer sorting algorithm selecting a pivot and partitioning elements around it. Quicksort averages O(n log
Fundamentals of algorithms
Algorithms and complexity
A simple sorting algorithm building sorted array incrementally by inserting unsorted elements. Insertion sort is O(n²) b
Fundamentals of algorithms
Algorithms and complexity
A non-comparison sorting algorithm for integers in fixed range, achieving O(n + k) time where k is range. Counting sort
Fundamentals of algorithms
Algorithms and complexity
A pathfinding algorithm combining actual cost from start with estimated cost to goal (heuristic). A* finds optimal paths
Fundamentals of algorithms
Algorithms and complexity
A problem-solving technique exploring solution space by building candidates incrementally and abandoning partial solutio
Fundamentals of algorithms
Subtopic b
An algorithm design paradigm dividing problems into smaller subproblems of same type, solving recursively, and combining
Fundamentals of algorithms
Subtopic b
Measurement of algorithm efficiency through time complexity (execution speed) and space complexity (memory usage). Big-O
Fundamentals of algorithms