01 Divide Conquer 02 Greedy Algorithm 03 Dynamic Slides: 19 Download presentation 01 Divide & Conquer 02 Greedy Algorithm 03 Dynamic Programming 04 Back Tracking 05 Branch & Bound 01 Divide & Conquer Divide & Conquer 10개의 자료 중 원하는 자료를 찾고자 함 Binary Search Selection Search Divide & Conquer Input Ouput 3, 20, 11, 5, 8, 9, 15, 17, 1, 4 5 02 Greedy Algorithm Greedy Algorithm 2. Huffman Algorithm : 해당 문자의 빈도수를 –로 나타낼 수 있도록 구현 Input Ouput Huffman Algorithm a -- b c … f g h i -- - … 03 Dynamic Programming Dynamic Programming 1. 최장공통부분순서 Input Ouput 첫 번째 문자열 : adfadfa 두 번째 문자열 : asdf 최장공통부분 : adfadf Dynamic Programming 2. 조약돌 놓기 : 조약돌이 놓인 자리에 있는 수의 합을 최대가 되도록 구현 Input Ouput 5392532258 0247572127 7030954604 63 04 Back Tracking Back Tracking 1. 미로탈출 : 0은 갈 수 있는 길을, 1은 갈 수 없는 벽을 나타낸다. Input Ouput 행, 열의 수 : 6 8 시작점과 도착점 : (1, 5) (6, 8) 11110111 11000011 10011011 11000111 10110111 11100000 (1, 5) (2, 4) (2, 3) (3, 3) (4, 4) (4, 5) (5, 5) (6, 6) (6, 7) (6, 8) 05 Branch & Bound Greedy vs divide and conquerDynamic programming vs divide and conquerVoronoi diagramDivide and conquer algorithmDelaunay triangulation divide and conquer algorithmDivide and conquer algorithm examplesStrassen's matrix multiplicationEuclidean algorithm divide and conquerGreedy vs dynamic programmingContoh algoritma divide and conquerDivide and conquer"conquer divide"Counting inversions divide and conquerDivide and conquerKnapsack problem divide and conquerDivide and conquer pseudocodeWhy do historians divide the past into erasIndex of soormaDefective chessboard problem divide and conquerDivide and conquer counting inversions