An Euler trail is a walk that uses every edge of a graph exactly once.An Euler circuit is a circuit that uses every edge of a graph exactly once.A Euler trail with same endpoints is a Euler circuit.Here are some examples:Letbe a finite co..
Prove that for , .Intuition: Suppose n people shake hands with other people in the group. They don't shake hands twice with the same person.How many handshakes take place?각 사람을 노드로 본다면 두 사람이 악수를 하면 그 두 노드 사이에 Edge 가 생긴다.전체 악수의 수 = N..
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 solu..
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 algori..
ACE Plugin 적용 : http://kwakyc87.tistory.com/160 참조 Karatsuba Multiplication implementation using Java 아주 큰 정수도 처리할 수 있게 String 값을 받아서 연산할 수 있게 구현 됐다 Recursively compute components Time Complexity Analysis using Master Method &..
Step 1: Find a maximum in a tournament style. The number of comparisons is equal to the number of matches that occur. For n competitors, there will be n - 1 matches until we get a champion (the max). We can see that the number..
- # 다각순열