<?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/32eeae3166bd43e696ad1f776eb8fdbf&quot; frameborder=&quot;0&quot; width=&quot;1838&quot; height=&quot;1378&quot; webkitallowfullscreen mozallowfullscreen allowfullscreen&gt;&lt;/iframe&gt;</html><height>1378</height><width>1838</width><provider_name>Loom</provider_name><provider_url>https://www.loom.com</provider_url><thumbnail_height>1378</thumbnail_height><thumbnail_width>1838</thumbnail_width><thumbnail_url>https://cdn.loom.com/sessions/thumbnails/32eeae3166bd43e696ad1f776eb8fdbf-164864d4cbb86a5c.gif</thumbnail_url><duration>1678.828</duration><title>9FM0 D1 Set 2 - Other Algorithms &amp;amp; Trace Tables</title><description>In this video, I walk through a trace of an algorithm using specific values for A and B, starting with A as 70 and B as 168. I carefully analyze each step, checking conditions like whether A is greater than, less than, or equal to B, and updating the values accordingly. By the end of the trace, I demonstrate how A and B change throughout the process, highlighting key calculations like B minus A resulting in 98 and later 28. I encourage you to follow along closely and ensure you understand each transition, as this will be crucial for our upcoming discussions on algorithms. Please take notes on the steps and be prepared to apply this knowledge in our next meeting.</description></oembed>