Master this deck with 12 terms through effective study methods.
Generated from uploaded pdf
Examines each element sequentially until the target is found.
Requires a sorted array and divides the search space in half.
Linear search can work on unsorted arrays, while binary search cannot.
It examines all elements and returns -1.
It is inefficient for large arrays, averaging N/2 comparisons.
It performs at most log2(N) comparisons, making it faster.
Compares adjacent elements and swaps them if out of order.
Locates the smallest element and places it in the correct position.
It is slow for large arrays due to many comparisons.
Selection sort makes fewer exchanges than bubble sort.
The array must be sorted before performing the search.
To arrange values in a specific order for easier searching.