æ¢çŽ¢ã¢ã«ãŽãªãºã 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