1.0Camdemy1.0http://media.usc.edu.tw雜湊法: 總和集(Sumsets)http://media.usc.edu.tw/user/http://media.usc.edu.tw/sysdata/doc/2/2bf49c235d04d094/thumb_l.jpg360640<iframe width='720' height='405' id='ccShare669' frameborder='0' src='http://media.usc.edu.tw/media/e/669' allowfullscreen></iframe>video7204051:42:11Sumsets總和集01Observation 1: a + b + c = d (暴力法)02Observation 2: a + b = d - c (省力法)03Observation 3: does (d – c) belong to T (暴力法)04Observation 3: does (d – c) belong to T (暴力法)05Observation 4: does (d – c) belong to T (省力法)06Observation 5: no solution (暴力法)07Observation 6: how to hash08Why is hash fast?09How to hash?010Design Issue 1: qsort in c library011Design Issue 2: to belong or not to belong(屬於或不屬於)012Design Issue 3: structures of hash table013Design Issue 3.1: generate hash table014Design Issue 3.2: hit hash table015Design Issue 3.2: hit hash table016Design Issue 3.3: collision linked list017Coding Part1: input elements of S018Coding Part2: qsort of elements of S019Coding Part3: create hash table and hit it020Coding Part4: review the whole program021fs1280x720720x4041280x720http://media.usc.edu.tw/sysdata/doc/2/2bf49c235d04d094/thumb.jpghttp://media.usc.edu.tw/sysdata/doc/2/2bf49c235d04d094/cover.jpghttp://media.usc.edu.tw/sysdata/doc/2/2bf49c235d04d094/video/thumbs/storyboard.jpghttp://media.usc.edu.tw/sysdata/doc/2/2bf49c235d04d0941