1
Q
Selection Sort
A
find the smallest unsorted element in an array and swap it with the first unsorted element of that array
2
Q
Bubble Sort
A
Swap adjacent paris of elements, if they are out of order, bubble up the highest number
3
Q
Insertion Sort
A
Left to right in an array, shift elements one at a time
4
Q
Merge Sort
A
Split the array into subarrays, then merge those subarrays back together in the correct order. Keep splitting in half.
5
Q
Binary Search
A
Given a sorted array, divide and conquer by systimatically eliminating half of the remaining elements to find target
6
Q
Linear search
A
iterate from left to right, try to find the target array
CS50
flashcards
Decks in class (3)
# Cards
