κ²μ μκ³ λ¦¬μ¦Beginner
μ΄μ§ κ²μ
λμμ μ€κ° μμμ λΉκ΅νκ³ κ²μ 곡κ°μ λ°λ³΅μ μΌλ‘ λ°μΌλ‘ μ€μ΄λ λ§€μ° ν¨μ¨μ μΈ κ²μ λ°©λ²μ λλ€. O(log n) μκ°μΌλ‘ 100λ§ κ°μ μμμμ λ¨ 20λ²μ λΉκ΅λ‘ νλͺ©μ μ°Ύμ μ μμ΅λλ€. μ¬μ μμ λ¨μ΄λ₯Ό μ°Ύλ κ²μ²λΌ μλν©λλ€.
#searching#divide-and-conquer#efficient
Complexity Analysis
Time (Average)
O(log n)Expected case performance
Space
O(1)Memory requirements
Time (Best)
O(1)Best case performance
Time (Worst)
O(log n)Worst case performance
π CLRS Reference
Introduction to Algorithmsβ’Chapter 2β’Section 2.3-5
Step: 1 / 0
500ms
SlowFast
Keyboard Shortcuts
Space Play/Pauseβ β StepR Reset1-4 Speed
Real-time Statistics
Algorithm Performance Metrics
Progress0%
Comparisons
0
Swaps
0
Array Accesses
0
Steps
1/ 0
Algorithm Visualization
Step 1 of 0
Initialize array to begin
Default
Comparing
Swapped
Sorted
Code Execution
Currently executing
Previously executed
Implementation