Note
Binary Search
Moves through the list until the wanted item is found using divide and conquer . Implementation Advantages Fast on larger datasets O 1 best case scenario, O log n worst case scenar...
computer-sciencealgorithmssearch
Tag view
2 related notes
Moves through the list until the wanted item is found using divide and conquer . Implementation Advantages Fast on larger datasets O 1 best case scenario, O log n worst case scenar...
Iterates through the list until the wanted item is found. Implementation Advantages Easy to program Fast on small datasets O 1 space Disadvantages O n slow on large datasets