Algoritmos CodiciososBeginner
Selección de Actividades
Selecciona el número máximo de actividades no superpuestas. Algoritmo codicioso clásico que siempre elige la actividad que termina más temprano.
#greedy#scheduling#optimization
Complexity Analysis
Time (Average)
O(n log n)Expected case performance
Space
O(n)Memory requirements
Time (Best)
O(n log n)Best case performance
Time (Worst)
O(n log n)Worst case performance
📚 CLRS Reference
Introduction to Algorithms•Chapter 16•Section 16.1
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