# 用JAVA學資料結構與演算法 筆記

## 前言
- [一些該說的東西](https://hackmd.io/@Aquamay/HJrXn_U9O)
- [物件導向(OOP)](https://hackmd.io/@Aquamay/rkAMTLIjd)

## 資料結構
- [資料結構簡介](https://hackmd.io/@Aquamay/rk1C8ni5d)
- [稀疏矩陣(Sparse Matrix)](https://hackmd.io/@Aquamay/Syd8UdLqu)
- [佇列(Queue)與環形佇列](https://hackmd.io/@Aquamay/S1eTd_LcO)
- [單向鏈結串列(Single Linked List)](https://hackmd.io/@Aquamay/HJxij_U9u)
- [雙向鏈結串列(Doubly Linked List)](https://hackmd.io/@Aquamay/rysZmo_cu)
- [棧(Stack)](https://hackmd.io/@Aquamay/rJQGIpu5O)
- [遞迴(Recursion)](https://hackmd.io/@Aquamay/BJ_2YSqqO)
- [雜湊表(Hash Table)](https://hackmd.io/@Aquamay/HkcpdfZiu)
- [二元樹(Binary Tree)](https://hackmd.io/@Aquamay/HyCgHXfid)
- [線索二元樹(Threaded Binary Tree)](https://hackmd.io/@Aquamay/HJIcU5Xjd)
- [二元搜尋樹(Binary Search Tree)](https://hackmd.io/@Aquamay/ry-S8q2i_)
- [圖(Graph)]() *施工中
- [資料結構小結](https://hackmd.io/@Aquamay/r1QNqio9O)

## 排序演算法
- [排序演算法簡介](https://hackmd.io/@Aquamay/S13xv3o5d)
- [時間複雜度](https://hackmd.io/@Aquamay/SkjWuni9u)
- [泡沫排序法(Bubble Sort)](https://hackmd.io/@Aquamay/HyyCFRj9d)
- [選擇排序法(Selection Sort)](https://hackmd.io/@Aquamay/Hy4Cwch9u)
- [插入排序法(Insert Sort)](https://hackmd.io/@Aquamay/S1tJMC35_)
- [希爾排序法(Shell Sort)](https://hackmd.io/@Aquamay/rkgO8fpcu)
- [快速排序法(Quick Sort)](https://hackmd.io/@Aquamay/B1SPnfRq_)
- [合併排序法(Merge Sort)](https://hackmd.io/@Aquamay/HJgJ3hxkou)
- [基數排序法(Radix Sort)](https://hackmd.io/@Aquamay/Bkm5b_Jsu)
- [堆積排序(Heap Sort)](https://hackmd.io/@Aquamay/rkwOakKo_)
- [排序法小結與複雜度比較](https://hackmd.io/@Aquamay/BylVMPFkiu)

## 搜尋演算法
* [搜尋演算法簡介](https://hackmd.io/@Aquamay/ryScdRJjd)
* [線性搜尋法(Linear Search)](https://hackmd.io/@Aquamay/B1s0YAysu)
* [二元搜尋法(Binary Search)](https://hackmd.io/@Aquamay/H1kHoC1jO)
* [插值搜尋法(Interpolation search)](https://hackmd.io/@Aquamay/rJZNuaxo_)
* [費氏搜尋法(Fibonacci Search)](https://hackmd.io/@Aquamay/SynpeGbiu)