<?xml version="1.0" encoding="utf-8"?>
<oembed><version>1.0</version><provider_name>Camdemy1.0</provider_name><provider_url>http://media.usc.edu.tw</provider_url><title>Algorithm_ch2</title><description></description><author_name></author_name><author_url>http://media.usc.edu.tw/user/</author_url><thumbnail_url>http://media.usc.edu.tw/sysdata/doc/9/9388a957a06ff5de/thumb_l.jpg</thumbnail_url><thumbnail_height>360</thumbnail_height><thumbnail_width>640</thumbnail_width><html>&amp;lt;iframe width='720' height='405' id='ccShare942' frameborder='0'  src='http://media.usc.edu.tw/media/e/942' allowfullscreen&amp;gt;&amp;lt;/iframe&amp;gt;</html><type>video</type><width>720</width><height>405</height><duration>22:03</duration><index><item_1><title>Time Complexity</title><time>0</time><indent>0</indent><sn>1</sn></item_1><item_2><title>f(n) = n3+n</title><time>47020</time><indent>0</indent><sn>2</sn></item_2><item_3><title>Asymptotic Notations (漸近符號) Big-O</title><time>526620</time><indent>0</indent><sn>3</sn></item_3><item_4><title>Problem Size</title><time>985920</time><indent>0</indent><sn>4</sn></item_4><item_5><title>Problem Size (Excel)</title><time>1135120</time><indent>0</indent><sn>5</sn></item_5></index><resolution><playtype>fs</playtype><subtype></subtype><src>1280x720</src><mp4>720x404</mp4><mp4_hd>1280x720</mp4_hd><mp4_4k></mp4_4k><mp4_1920></mp4_1920><mp4_src></mp4_src><mp4_base></mp4_base></resolution><base_image><thumb>http://media.usc.edu.tw/sysdata/doc/9/9388a957a06ff5de/thumb.jpg</thumb><cover>http://media.usc.edu.tw/sysdata/doc/9/9388a957a06ff5de/cover.jpg</cover><storyboard>http://media.usc.edu.tw/sysdata/doc/9/9388a957a06ff5de/video/thumbs/storyboard.jpg</storyboard></base_image><srcFrom></srcFrom><base_url>http://media.usc.edu.tw/sysdata/doc/9/9388a957a06ff5de</base_url><status>1</status></oembed>
