1D Arrays - Recap Searching and Sorting

Flashcards covering 1D arrays, searching, and sorting algorithms.

1D Array

A data structure that stores a fixed-size sequential collection of elements of the same type.

Searching

The process of finding a specific element within an array.

Sorting

The process of rearranging the elements of an array into a specific order.

Linear Search

An algorithm that sequentially checks each element of an array until the target element is found or the entire array has been searched.

Binary Search

An algorithm that repeatedly divides a sorted array in half, comparing the middle element to the target element to narrow down the search.

Bubble Sort

An algorithm where adjacent elements are compared and swapped if they are in the wrong order, causing larger elements to 'bubble' to the end of the array.

Selection Sort

An algorithm that repeatedly finds the minimum element from the unsorted portion of the array and places it at the beginning.

Index

The index to process the array

Flag

A flag that shows when target is found