검색어 입력폼

데이터 구조 과제, 하노이의 탑, 이진 탐색(itr, recursive)

저작시기 2016.04 |등록일 2017.10.13 | 최종수정일 2017.10.16 파일확장자압축파일 (zip) | 가격 2,000원

소개글

1. There are three towers and 64 disks of different diameters placed on the first tower. The disks are in order of decreasing diameter as one scans up the tower. Monks were reputedly supposed to move the disk from tower 1 to tower 3 obeying the rules :
(a) Only one disk can be moved at any time.
(b) No disk can be placed on top of a disk with a smaller diameter.
Write the iterative(반복의) (Program 2-1) and recursive(회귀의) (Program 2-2) binary search function and measure the worst case performance of both functions (using Program 1.25), and analyze average case time complexity of binary search algorithm.

컴파일 실행환경

비쥬얼 스튜디오 2015
다운로드 맨위로