**How to Design - Case by Case**

When designing an algorithm, ask yourself : For which cases does the obvious method work? Then find a new way to tackle the remaining cases! 예제) Find a hamiltonian path through a tournament graph. Using a more-of-input approach, we claim to have a solution while pretending that the nodes we have processed so far is the entire input instance. We want to maintain the Loop Invariant by adding a new..

Comp Sci/Tips
2017.12.18 00:00

**Loop Invariant Practice - Merge() of MergeSort()**

How to Think about Algorithms by Edmonds has good in-depth explanation of how to actually go about thinking about designing algorithms and approaching algorithmic problems. I applied the process to understanding Merge() routine of the MergeSort algorithm.

Comp Sci/Algorithms
2017.11.28 15:19

**공지사항**

**최근에 올라온 글**

**최근에 달린 댓글**

- Total
- 1,032

- Today
- 0

- Yesterday
- 0

**링크**

**TAG**

- #state
- #Constructive_Counting
- image
- codomain
- surjective
- #BMI
- Edmonds
- Component
- TIP
- #Permutations
- #uncontrolled_components
- #Mutual_Exhaustivity
- definitions
- #controlled_components
- #onChange
- relation
- subgraph
- trail
- #props
- cycle
- #Combinations
- #Mutual_Exclusivity
- #Circular_Permutations
- Circuit
- Graph
- degree
- #Counting
- proof
- Induction
- HTTAA