<?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/c08727a1f00d4c1aa29bc578651e9a3b&quot; frameborder=&quot;0&quot; width=&quot;1920&quot; height=&quot;1440&quot; webkitallowfullscreen mozallowfullscreen allowfullscreen&gt;&lt;/iframe&gt;</html><height>1440</height><width>1920</width><provider_name>Loom</provider_name><provider_url>https://www.loom.com</provider_url><thumbnail_height>1440</thumbnail_height><thumbnail_width>1920</thumbnail_width><thumbnail_url>https://cdn.loom.com/sessions/thumbnails/c08727a1f00d4c1aa29bc578651e9a3b-1683363904051.gif</thumbnail_url><duration>1826.794</duration><title>assortedRecursion [reverseNumber, findFibonacci, toPower]</title><description>hi! this is assorted recursion. i recommend watching on 1.5x or 2x speed! sorry for the background noise lol i was too lazy to use my microphone 😭

TIMESTAMPS

reverseNumber: base case + recursive case explanation : 0:00 - 6:30 
mod / math explanation  (you can skip after 6:30 if you don&apos;t care how the math works and just want the formula lol!!!) : 6:30 - 9:05
reverseNumber CODE : 11:21 - 14:17

findFibonacci - 14:17 - 23:11

toPower: 23:29 - end</description></oembed>