Searches and sorts APCSA

w

Big O selection sort

n^2s

Big O insertion sort

n²ⁱ

Big O bubble sort

n^2b

Big O merge sort

nLogn

Big O linear search

n

Big o binary search

logn

binary search

only works if sorted; splits the middle

linear search

works through list checking for target value

selection sort

runs through the whole list and stores the smallest value; then takes the smallest value and sends it to the front of the list.

insertion sort

considers the first value the sorted part of the array, and then checks the value behind it to see if it is greater or less than the value. if greater, it moves on to the next index. if less, it is moved in front of the initial value

Bubble sort

bubbles up

Merge sort

merge sort