Algorithmics (演算法) 2020

5. ��v�t��k(2): (Alg-Divide&Conquer.pptx[1]�� �b�q)(FFT.zip[2]) (4/7)(�v��Ш� Offline Video��})(��ij�P�ǥ��.0�ҵ{�ѻ��v��B�M���.2�B.3�B.4�v��A�̫�A�ݤ��e��`��.1�v ��) .1 ��v�ֳt�ť߸��ܴ�(fast Fourier transform, FFT)�t��k .2 ��v�G��D ��(2D rank finding)�t��k .3 ��v�G��j�I(2D maxima finding)�t��k .4 ��v�G ���̪��I��(2D closest pair of points)�t��k Homework 5:  (�C��ǥͳ��n���g2�D: A�D�������D�AB, C, D, E �� F�� �h���@�D) A. �|�һ���@�ӧֳt�ť߸��ܴ�����ΡC B. �g�@�Ӥ�v�t��k�ӸѨM�@�ӵ��w�ƭȶ��X ���D��(rank finding)���D�A�öi�����פ�R�C C. �g�@����v�t��k�ӧ�X�@�s�bX�b�W���I�����̪��I��(closest pair of points on X-axis)�A�öi������ ��R�C D. ���w8�ӤG���I: (1, 4), (2, 2), (3, 5), (4, 8), (5, 6), (6, 3), (7, 9), (8, 7)�A�e�ϻ���ϥΤ�v�G��j�I�t��k�D�X�Ҧ����j�I(maxima)���L�{�C E. ���w8�ӤG���I: (1, 4), (2, 2), (3, 5), (4, 8), (5, 6), (6, 3), (7, 9), (8, 7)�A�e�ϻ���ϥΤ�v�G��D���t��k�D�X�C���I����(rank)���L�{�C F. ���w8�ӤG���I: (1, 4), (2, 2), (3, 5), (4, 8), (5, 6), (6...