<?xml version="1.0" encoding="UTF-8"?><oembed><type>video</type><version>1.0</version><html>&lt;iframe src=&quot;https://www.loom.com/embed/f1c8a11cd25a431da79b71eed1b65b2c&quot; frameborder=&quot;0&quot; width=&quot;1514&quot; height=&quot;1135&quot; webkitallowfullscreen mozallowfullscreen allowfullscreen&gt;&lt;/iframe&gt;</html><height>1135</height><width>1514</width><provider_name>Loom</provider_name><provider_url>https://www.loom.com</provider_url><thumbnail_height>1135</thumbnail_height><thumbnail_width>1514</thumbnail_width><thumbnail_url>https://cdn.loom.com/sessions/thumbnails/f1c8a11cd25a431da79b71eed1b65b2c-c8a875a9e6b2f94b.gif</thumbnail_url><duration>270.747</duration><title>Building a Python Classifier for Analyzing Runtime Complexity in Big O Notation 🚀</title><description>In this video, I demonstrate my web app, Biggie-D-O, which classifies Python code based on its runtime complexity in big-O notation. I showcase examples like merge sort and bubble sort, highlighting the app&apos;s speed and accuracy in providing the correct complexity analysis. The model I developed achieved an 88% F1 macro score using a deep learning approach with 1.3 billion parameters. I utilized existing datasets and conducted thorough model selection and fine-tuning. I encourage viewers to check out the links in my repository for more details and insights on the project.</description></oembed>