{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"\u96dc\u6e4a\u6cd5: \u7e3d\u548c\u96c6(Sumsets)","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/2\/2bf49c235d04d094\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare669' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/669' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"duration":"1:42:11","index":{"item_1":{"title":"Sumsets\u7e3d\u548c\u96c6","time":"0","indent":"0","sn":"1"},"item_2":{"title":"Observation 1: a + b + c = d (\u66b4\u529b\u6cd5)","time":"76350","indent":"0","sn":"2"},"item_3":{"title":"Observation 2: a + b = d - c (\u7701\u529b\u6cd5)","time":"327100","indent":"0","sn":"3"},"item_4":{"title":"Observation 3: does (d \u2013 c) belong to T (\u66b4\u529b\u6cd5)","time":"447450","indent":"0","sn":"4"},"item_5":{"title":"Observation 3: does (d \u2013 c) belong to T (\u66b4\u529b\u6cd5)","time":"582650","indent":"0","sn":"5"},"item_6":{"title":"Observation 4: does (d \u2013 c) belong to T (\u7701\u529b\u6cd5)","time":"592350","indent":"0","sn":"6"},"item_7":{"title":"Observation 5: no solution (\u66b4\u529b\u6cd5)","time":"655650","indent":"0","sn":"7"},"item_8":{"title":"Observation 6: how to hash","time":"738450","indent":"0","sn":"8"},"item_9":{"title":"Why is hash fast?","time":"841150","indent":"0","sn":"9"},"item_10":{"title":"How to hash?","time":"1269800","indent":"0","sn":"10"},"item_11":{"title":"Design Issue 1: qsort in c library","time":"1348600","indent":"0","sn":"11"},"item_12":{"title":"Design Issue 2: to belong or not to belong(\u5c6c\u65bc\u6216\u4e0d\u5c6c\u65bc)","time":"1852800","indent":"0","sn":"12"},"item_13":{"title":"Design Issue 3: structures of hash table","time":"1970100","indent":"0","sn":"13"},"item_14":{"title":"Design Issue 3.1: generate hash table","time":"2307450","indent":"0","sn":"14"},"item_15":{"title":"Design Issue 3.2: hit hash table","time":"2713750","indent":"0","sn":"15"},"item_16":{"title":"Design Issue 3.2: hit hash table","time":"2778400","indent":"0","sn":"16"},"item_17":{"title":"Design Issue 3.3: collision linked list","time":"2952000","indent":"0","sn":"17"},"item_18":{"title":"Coding Part1: input elements of S","time":"3092000","indent":"0","sn":"18"},"item_19":{"title":"Coding Part2: qsort of elements of S","time":"3458800","indent":"0","sn":"19"},"item_20":{"title":"Coding Part3: create hash table and hit it","time":"3800100","indent":"0","sn":"20"},"item_21":{"title":"Coding Part4: review the whole program","time":"5714400","indent":"0","sn":"21"}},"resolution":{"playtype":"fs","subtype":"","src":"1280x720","mp4":"720x404","mp4_hd":"1280x720","mp4_4k":"","mp4_1920":"","mp4_src":"","mp4_base":""},"base_image":{"thumb":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/2\/2bf49c235d04d094\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/2\/2bf49c235d04d094\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/2\/2bf49c235d04d094\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/2\/2bf49c235d04d094","status":true}