{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"Algorithm_divideandconquer","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/3\/39d25dffa5ab6a65\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare955' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/955' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"duration":"10:18","index":{"item_1":{"title":"Divide and Conquer","time":"0","indent":"0","sn":"1"},"item_2":{"title":"A Simple Example","time":"28370","indent":"0","sn":"2"},"item_3":{"title":"Time Complexity","time":"134020","indent":"0","sn":"3"},"item_4":{"title":"A General Divide-and-Conquer Algorithm","time":"350420","indent":"0","sn":"4"},"item_5":{"title":"Time Complexity of the General Algorithm","time":"519420","indent":"0","sn":"5"},"item_6":{"title":"2-D Maxima Finding Problem","time":"609420","indent":"0","sn":"6"}},"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\/3\/39d25dffa5ab6a65\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/3\/39d25dffa5ab6a65\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/3\/39d25dffa5ab6a65\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/3\/39d25dffa5ab6a65","status":true}