Programming Question
View this question.
Add this question to a group or test by clicking the appropriate button below.
This is an efficient algorithm for finding an item from an ordered list of items. It 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.
- Binary Search Algorithm
- Bubble Sort
- Insertion Sort
- Linear Search Algorithm
- Merge Sort
- Quick Sort
- Selection Sort