Programmation dynamiqueIntermediate
Longest Increasing Subsequence
Find the longest subsequence where all elements are in increasing order. Classic DP problem.
#dynamic-programming#binary-search#optimization#sequences
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
How it works
- • Find longest subsequence in increasing order
- • Dynamic programming approach
- • O(n²) time complexity (DP solution)
- • O(n) space complexity
- • Classic DP problem with optimal substructure
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