Searching & Sorting

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

Searching

The algorithmic process of finding a particular item in a collection of items.

Membership

The question answered by a search algorithm as to whether an item is present or not.

Sequential Search

A search method that checks each element in a list in order to find a particular item.

Ordered List

A list where elements are arranged in a specific order.

Binary Search

An efficient algorithm for finding an item in a sorted list by repeatedly dividing the search interval in half.

Bubble Sort

A sorting algorithm that repeatedly passes through a list, compares adjacent items and exchanges them if they are in the wrong order.

Selection Sort

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

Insertion Sort

A sorting algorithm that builds a sorted list one item at a time by repeatedly placing the next item in the correct position within the already sorted portion of the list.

ValueError

An error raised when a search for a non-existing item occurs, indicating that the item is not in the list.

Recursive Binary Search

A binary search method that calls itself with a subset of the list to find a particular item.