이진 검색 알고리즘
Also known as half-interval search, logarithmic search, binary chop
검색 공간을 각 패스의 절반으로 줄여 작동하는 정렬된 목록의 검색 알고리즘
AI overview
Binary search is a method for finding a specific item in a sorted list by repeatedly dividing the search area in half, eliminating half of the remaining possibilities with each step. It matters because this approach is much faster than checking every item one by one, especially when dealing with large lists.
AI-generated from the Wikipedia summary — may contain errors.
Key facts
- Class
- Search algorithm
- Data structure
- Array
- Worst case performance
- O (log n )
- Best case performance
- O (1)
- Average performance
- O (log n )
- Worst case space complexity
- O (1)
- Optimal
- Yes
via Wikipedia infobox