Please enable JavaScript.
Coggle requires JavaScript to display documents.
Sorting and Searching Algorithms (SORTING (Bubble (Linear algorithm, small…
Sorting and Searching 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
Insertion
Linear algorithm
medium memory needed
Merge
Divide and conquer algorithm
large memory needed