### 하늘을 날다~ 쿼드콥터 (1)

갑자기 하늘을 날아보고 싶다는 생각이 들었다.
과거 라이트형제은 날아보고 싶다는 생각에 비행기를 만들었을것이다.
나는 아두노이로 쿼드콥터를 만들어봐야겠다.
아두노이도 없고 부품도 없고 아무것도 없다.
부품도 사고 이것저것 사야할것 같다.
오늘부터 쿼드콥터를 만드는거 도전한다.
제발 만들다가 그만두지 말기를...

- Get link
- Google+
- Other Apps

갑자기 하늘을 날아보고 싶다는 생각이 들었다.
과거 라이트형제은 날아보고 싶다는 생각에 비행기를 만들었을것이다.
나는 아두노이로 쿼드콥터를 만들어봐야겠다.
아두노이도 없고 부품도 없고 아무것도 없다.
부품도 사고 이것저것 사야할것 같다.
오늘부터 쿼드콥터를 만드는거 도전한다.
제발 만들다가 그만두지 말기를...

- Get link
- Google+
- Other Apps

I thought about one hour to come up with idea.

just find F(10^25)

1 : 1

2 : 2

3 : 1

4 : 3

5 : 2

6 : 3

7 : 1

8 : 4

9 : 3

10 : 5

11 : 2

12 : 5

13 : 3

14 : 4

15 : 1

16 : 5

17 : 4

18 : 7

19 : 3

20 : 8

21 : 5

22 : 7

23 : 2

24 : 7

25 : 5

26 : 8

27 : 3

28 : 7

29 : 4

30 : 5

31 : 1

32 : 6

33 : 5

34 : 9

35 : 4

36 : 11

37 : 7

38 : 10

39 : 3

40 : 11

41 : 8

42 : 13

43 : 5

44 : 12

45 : 7

46 : 9

47 : 2

48 : 9

49 : 7

50 : 12

51 : 5

52 : 13

53 : 8

54 : 11

55 : 3

56 : 10

57 : 7

58 : 11

59 : 4

60 : 9

61 : 5

62 : 6

63 : 1

64 : 7

65 : 6

66 : 11

67 : 5

68 : 14

69 : 9

70 : 13

71 : 4

72 : 15

73 : 11

74 : 18

75 : 7

76 : 17

77 : 10

78 : 13

79 : 3

80 : 14

81 : 11

82 : 19

83 : 8

84 : 21

85 : 13

86 : 18

87 : 5

88 : 17

89 : 12

90 : 19

91 : 7

92 : 16

93 : 9

94 : 11

95 : 2

96 : 11

97 : 9

98 : 16

99 : 7

100 : 19

just find F(10^25)

1 : 1

2 : 2

3 : 1

4 : 3

5 : 2

6 : 3

7 : 1

8 : 4

9 : 3

10 : 5

11 : 2

12 : 5

13 : 3

14 : 4

15 : 1

16 : 5

17 : 4

18 : 7

19 : 3

20 : 8

21 : 5

22 : 7

23 : 2

24 : 7

25 : 5

26 : 8

27 : 3

28 : 7

29 : 4

30 : 5

31 : 1

32 : 6

33 : 5

34 : 9

35 : 4

36 : 11

37 : 7

38 : 10

39 : 3

40 : 11

41 : 8

42 : 13

43 : 5

44 : 12

45 : 7

46 : 9

47 : 2

48 : 9

49 : 7

50 : 12

51 : 5

52 : 13

53 : 8

54 : 11

55 : 3

56 : 10

57 : 7

58 : 11

59 : 4

60 : 9

61 : 5

62 : 6

63 : 1

64 : 7

65 : 6

66 : 11

67 : 5

68 : 14

69 : 9

70 : 13

71 : 4

72 : 15

73 : 11

74 : 18

75 : 7

76 : 17

77 : 10

78 : 13

79 : 3

80 : 14

81 : 11

82 : 19

83 : 8

84 : 21

85 : 13

86 : 18

87 : 5

88 : 17

89 : 12

90 : 19

91 : 7

92 : 16

93 : 9

94 : 11

95 : 2

96 : 11

97 : 9

98 : 16

99 : 7

100 : 19

Before starting to explain Floyd algorithm, I want to compare Dijkstra algorithm with Floyd.

Dijkstra's algorithm

1. it is used only when we already know start node to all nodes this means that source node should be single. 2. It will fail if graph has negative distance. distance or weight should be > 0 3. it is also called*single-source shortest path* or **SSSP** algorithm. 4. O(N^2)

Floyd-Warshall's algorithm

1. it is used to find all nodes to all nodes 2. This only fails when there are negative cycles. 3. O(N^3) 4. We can have one or more links of negative cost, c(x, y)<0,

Later on, I will Study Bellman-Ford and also post on blog.

1**let** dist be a |V| × |V| array of minimum distances initialized to ∞ (infinity)
2 **for each** vertex *v*
3 dist[*v*][*v*] ← 0
4 **for each** edge (*u*,*v*)
5 dist[*u*][*v*] ← w(*u*,*v*) *// the weight of the edge (*u*,*v*)*
6 **for***k***from** 1 **to** |V|
7 **for***i***from** 1 **to** |V|
8 **for***j***from** 1 **to** |V|
9 **if** dist[*i*][*j*] > dist[*i*][*k*] + dist[*k*][*j*]
10 dist[*i*][*j*]…

Dijkstra's algorithm

1. it is used only when we already know start node to all nodes this means that source node should be single. 2. It will fail if graph has negative distance. distance or weight should be > 0 3. it is also called

Floyd-Warshall's algorithm

1. it is used to find all nodes to all nodes 2. This only fails when there are negative cycles. 3. O(N^3) 4. We can have one or more links of negative cost, c(x, y)<0,

Later on, I will Study Bellman-Ford and also post on blog.

1

## Comments

## Post a Comment