Please enable JavaScript.
Coggle requires JavaScript to display documents.
searching and sorting algorithms (sorting (bubble (linear algorithm, small…
searching and sorting algorithms
searching
binary
Best time = 1
worst time <N
divide and conquer algorithm
must have a sorted list
linear
Best time = 1
Worst time = N
linear algorithm
works on a sorted or unsorted list
sorting
bubble
linear algorithm
small amount of memory needed
merge
divide and conquer algorithm
large memory needed
insersion
linear algorithm
medium memory needed