Classic Algorithms - Sorting

Flashcards containing key vocabulary and definitions related to classic algorithms in sorting.

Sorting

The process of arranging items in a specific order.

Bubble Sort

A simple sorting algorithm that repeatedly compares adjacent pairs of elements and swaps them if they are in the wrong order.

Quick Sort

A divide-and-conquer sorting algorithm that selects a pivot element from the list and partitions the other elements into two sub-arrays according to whether they are less than or greater than the pivot.

Radix Sort

A non-comparison sorting algorithm that sorts numbers based on their individual digits, processing from least significant to most significant.

Big-Oh Notation

A mathematical notation that describes the upper bound of an algorithm's time complexity, generally denoted as O(f(n)).

Best Case

The scenario in which an algorithm performs the minimum number of operations, often assumed to occur under ideal conditions.

Worst Case

The scenario in which an algorithm performs the maximum number of operations, often indicating the longest time an algorithm can take.

Computational Complexity

A measure of the amount of resources (like time and space) that an algorithm uses in relation to the size of the input data.

Stupid Sort (Bogosort)

An extremely inefficient sorting algorithm that generates permutations of its input until it finds one that is sorted.

Selection Sort

A sorting algorithm that divides the input into two parts: a sorted and an unsorted part, repeatedly selecting the smallest remaining element from the unsorted part and moving it to the end of the sorted part.