κ²μ μκ³ λ¦¬μ¦Beginner
μ ν κ²μ
μ²μλΆν° λκΉμ§ κ° μμλ₯Ό μμ°¨μ μΌλ‘ νμΈνλ κ°μ₯ κΈ°λ³Έμ μΈ κ²μ λ°©λ²μ λλ€. μ λ ¬λμ§ μμ λ°μ΄ν°λ λ¨μν¨μ΄ μ€μν μμ λ°°μ΄μ μ¬μ©λ©λλ€. ꡬνμ κ°λ¨νμ§λ§ O(n) μκ°μ΄ νμν ν° λ°μ΄ν°μ μμλ λλ €μ§λλ€.
#searching#simple#sequential#beginner-friendly
Complexity Analysis
Time (Average)
O(n)Expected case performance
Space
O(1)Memory requirements
Time (Best)
O(1)Best case performance
Time (Worst)
O(n)Worst case performance
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