I study diferent algorithms and this is my "note-book"
Sorting:
| Algorithm | Сomplexity | Memory | Stable |
|---|---|---|---|
| Insertion Sort | ![]() |
1 | ✔️ |
| Selection Sort | ![]() |
1 | ✖️ |
| Bubble Sort | ![]() |
1 | ✔️ |
| Quick Sort | ![]() |
n | ✖️ |
| Merge Sort | ![]() |
n | ✔️ |
| Tree Sort | ![]() |
n | ✔️ |
| Heapsort | ![]() |
1 | ✖️ |
| Shell Sort | ![]() |
1 | ✖️ |
| Smooth Sort | ![]() |
1 | ✖️ |
| Bucket Sort | ![]() |
n*k | ✔️ |
Search:
| Algorithm | Сomplexity | Memory |
|---|---|---|
| Binary Search | ![]() |
1 |







