This algorithm finds the position of a target value within a sorted list. the algorithm works by repeatedly dividing in half the portion of the list that could contain the item, until you've narrowed down the possible locations to just one.

O Quicksort

O Kruskal's Minimum Spanning Tree algorithm

$$ Binary search

$$ Merge sort

$$ none of these

O Dijkstra's Shortest Path algorithm

$$ Bubble sort

$$ Insertion sort

O Prim's Minimum Spanning Tree algorithm

$$ Depth first search

$$ Bucket sort

$$ Linear search