# Break Away: Programming And Coding Interviews & Cracking coding interview

- [System design and scalability](/algorithm/algorithms-in-a-nutshell/system-design-and-scalability.md)
- [Performance and Complexity](/algorithm/algorithms-in-a-nutshell/performance-and-complexity.md): Performance的三個要素是時間, 空間, 網路; Complexity是用來衡量Performance的指標
- [Big O Notation](/algorithm/algorithms-in-a-nutshell/big-o-notation.md): Big O Notation是用來衡量Complexity的指標
- [Sorting trade-off](/algorithm/algorithms-in-a-nutshell/sorting-trade-off.md)
- [Selection sort](/algorithm/algorithms-in-a-nutshell/selection-sort.md)
- [Bubble sort](/algorithm/algorithms-in-a-nutshell/bubble-sort.md)
- [Insertion sort](/algorithm/algorithms-in-a-nutshell/insertion-sort.md)
- [Shell sort](/algorithm/algorithms-in-a-nutshell/shell-sort.md)
- [Merge sort](/algorithm/algorithms-in-a-nutshell/merge-sort.md)
- [Quick sort](/algorithm/algorithms-in-a-nutshell/quick-sort.md)
- [Binary search](/algorithm/algorithms-in-a-nutshell/binary-search.md)
- [Recursion](/algorithm/algorithms-in-a-nutshell/recursion.md)
- [Binary tree](/algorithm/algorithms-in-a-nutshell/meet-binary-tree-a-hierarchical-data-structure.md)
- [Breadth First Traversal](/algorithm/algorithms-in-a-nutshell/breadth-first-traversal.md)
- [Depth First Pre-Order](/algorithm/algorithms-in-a-nutshell/depth-first-pre-order.md)
- [Binary search tree](/algorithm/algorithms-in-a-nutshell/binary-search-tree.md)
- [Stack](/algorithm/algorithms-in-a-nutshell/stack.md)
- [Queue](/algorithm/algorithms-in-a-nutshell/queue.md)
- [Linked list](/algorithm/algorithms-in-a-nutshell/linked-list.md)
- [Doubly linked list](/algorithm/algorithms-in-a-nutshell/doubly-linked-list.md)
- [String](/algorithm/algorithms-in-a-nutshell/string.md)
- [Pointer and array](/algorithm/algorithms-in-a-nutshell/pointer-and-array.md)
- [Bit manipulation](/algorithm/algorithms-in-a-nutshell/bit-manipulation.md)
- [General programming problems](/algorithm/algorithms-in-a-nutshell/general-programming-problems.md)
- [Priority queue](/algorithm/algorithms-in-a-nutshell/priority-queue.md)
- [Balanced binary search tree](/algorithm/algorithms-in-a-nutshell/balanced-binary-search-tree.md)
- [Binary heap](/algorithm/algorithms-in-a-nutshell/binary-heap.md): Binary heap use an implicit relationship specified by the indices
- [Heap sort](/algorithm/algorithms-in-a-nutshell/heap-sort.md)
- [Graphs](/algorithm/algorithms-in-a-nutshell/graphs.md)
- [Topological sort](/algorithm/algorithms-in-a-nutshell/topological-sort.md)
