Searching and Sorting Algorithms

These flashcards cover key vocabulary related to searching and sorting algorithms as discussed in the lecture.

Linear Search

An algorithm that sequentially examines each element in an array until the desired value is found.

Binary Search

An efficient algorithm that requires sorted data and repeatedly divides the search interval in half to locate a value.

Bubble Sort

A sorting algorithm that repeatedly compares adjacent elements and swaps them if they are in the wrong order, continuing until no swaps are needed.

Selection Sort

A sorting algorithm that divides the input into a sorted and an unsorted region, repeatedly selecting the smallest element from the unsorted region and moving it to the sorted region.

Search Algorithm

A procedure for finding an item or value within a list of information.

Tradeoff

A compromise between the benefits and disadvantages of an algorithm, such as ease of implementation versus efficiency.

Array

A collection of elements, typically of the same data type, stored in contiguous memory locations.

Efficiency

The effectiveness of an algorithm in terms of time and resources required to complete its task.

Comparison

An operation that determines the relative order of two values, commonly used in search and sort algorithms.

Parameter

A variable used in a function to accept input during its call, enabling the function to operate on varying data.