{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"Algorithm_ch2","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/9388a957a06ff5de\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare942' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/942' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"duration":"22:03","index":{"item_1":{"title":"Time Complexity","time":"0","indent":"0","sn":"1"},"item_2":{"title":"f(n) = n3+n","time":"47020","indent":"0","sn":"2"},"item_3":{"title":"Asymptotic Notations (\u6f38\u8fd1\u7b26\u865f) Big-O","time":"526620","indent":"0","sn":"3"},"item_4":{"title":"Problem Size","time":"985920","indent":"0","sn":"4"},"item_5":{"title":"Problem Size (Excel)","time":"1135120","indent":"0","sn":"5"}},"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\/9\/9388a957a06ff5de\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/9388a957a06ff5de\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/9388a957a06ff5de\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/9388a957a06ff5de","status":true}