28 lines
664 B
Markdown
28 lines
664 B
Markdown
## Outline
|
|
- Abstract Algebraic Data types
|
|
- Elementary types
|
|
- List
|
|
- Stack
|
|
- Queue
|
|
- Set
|
|
- Searching algorithms
|
|
- Tree
|
|
- Binary
|
|
- General
|
|
- BST
|
|
- AVL
|
|
- A234
|
|
|
|
## Abstract Algebraic Data Types
|
|
### Signature and hierarchy
|
|
- a signature is composed by
|
|
- a type (integer, stack, queue, graph)
|
|
- an operations (name: profile)
|
|
- Exemple:
|
|
- ``insert: list x integer x element -> list``
|
|
- ``insert(l, i, e)``
|
|
- return a result of type `list`
|
|
- We can use the `_`to pass an argument without parentheses
|
|
- `facotrial: interger -> integer`= `_!: interger -> integer`
|
|
- `power: integer x integer -> integer`= `_^_: integer x integer -> integer`
|
|
- |