Search algorithms:
| name | complexity | description |
|---|---|---|
| max | O(n) | maximum in &[T] |
| min | O(n) | minimum in &[T] |
| binary | O(log2n) | binary search in &[T] |
| lcs | O(mn) | longest common subsequence |
Sort algorithms:
| name | complexity |
|---|---|
| selection | O(n2) |
| quick | O(n log2n) |
| name | description |
|---|---|
| Matrix | two-dimensional array |