@abreen/tada 1.15.6 → 1.15.8

package/init/content/labs/02/index.md

@@ -25,12 +25,10 @@ Selection sort is a well-known comparison-based sorting algorithm.
 
 Selection sort's strength is its simplicity.
 
+- The helper method, `index_smallest()` is easy to understand
 - `index_smallest()` always scans from `start` to the end
 - It requires no additional memory (other than local variables)
 
-However, it has no `break` statements and therefore can't return early if
-the array is already sorted.
-
 ---
 
 ## Performance
@@ -51,12 +49,16 @@ The innermost statement compares `nums[i]` and `nums[curr]`.
 - when `i` is $n - 3$, the comparison is executed two times
 - when `i` is $n - 2$, the comparison is executed one time
 
-Therefore the total number of comparisons is
+Therefore the total number of comparisons $C(n)$ is
 
 $$
-(n-1) + (n-2) + \dots + 1 = \sum_{i=1}^{n-1}i
+(n-1) + (n-2) + \dots + 1 = \sum_{i=1}^{n-1}i = \frac{n(n-1)}{2}
 $$
 
+??? question What complexity class does $C(n)$ belong to?
+It's a quadratic function. The class is $O(n^2)$.
+???
+
 ---
 
 ## Review

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@abreen/tada",
-  "version": "1.15.6",
+  "version": "1.15.8",
   "type": "module",
   "description": "A static site generator",
   "license": "MIT",

package/src/question/style.scss

@@ -112,6 +112,10 @@
   }
 }
 
+.js body.is-presenting .question-a-body::after {
+  display: none;
+}
+
 .js .question-a-body[data-revealed] {
   cursor: unset;
 

package/src/trace/style.scss

@@ -2,7 +2,7 @@
   display: flex;
   flex-direction: column;
   gap: var(--gap);
-  height: calc(100dvh - var(--header-collapsed-height) - 3 * var(--gap));
+  height: calc(100svh - var(--header-collapsed-height) - 3 * var(--gap));
   overflow: hidden;
 }