# 自我問答

## 程式設計相關

### 到目前為止學過的資料結構?

* 資料結構: 組織、管理、儲存資料的方式
1. Array
2. Linked List, Doubly linked list
3. Stack (last in first out)
4. Queue (first in first out)
5. LRU Cache (Least recently used) (不熟)
6. Tree
7. Trie (字典樹)
8. Heap
9. Segment Tree
10. Graph
11. Hash Table, Hash Map

***

### 到目前為止學過的演算法?

* 穩定的排序算法
1. Bubble Sort
2. Insersion Sort
3. Merge Sort
4. Counting Sort
5. Bucket Sort
6. Radix Sort

* 不穩定的排序算法
1. Quick Sort
2. Heap Sort

* 搜尋
1. Binary Search (Array)
2. 字串搜尋 - KMP, Hash, Trie
4. Depth-First-Search (Tree or Graph)
5. Breadth-First-Search (Tree or Graph)

* Graph
1. Dijkstra's Shortest Path Algorithm
2. Max Flow Ford Fulkerson
3. Edmonds Karp Algorithm

* Cryptography
1. MD5
2. Sha256
3. DES
4. RSA

* 其它
1. Dynamic Programming
2. Sliding Window
3. Bit Manipulation
4. Greedy
5. Divide and Conquer
6. Minimax
7. Math

***

### 在 42 做過的 Project?

1. Libft
2. Get_next_line
3. Fillit
4. FdF
5. Fract'ol
6. ft_printf
7. Filler
8. push_swap
9. lem-in
10. ft_ssl_md5
11. ft_ls
12. Interview Piscine