chore: formatting

Signed-off-by: Jose Storopoli <jose@storopoli.io>
storopoli · Nov 30, 2024 · 067b1ac · 067b1ac
1 parent 8d9e8a4
commit 067b1ac
Show file tree

Hide file tree

Showing 2 changed files with 137 additions and 20 deletions.
diff --git a/slides/slides-pt.typ b/slides/slides-pt.typ
@@ -66,7 +66,8 @@ Blank space can be filled with vertical spaces like #v(1fr).
     grid(
       columns: 2,
       gutter: 2mm,
-      image("images/turing.jpg", width: 60%), image("images/church.jpg", width: 60%),
+      image("images/turing.jpg", width: 60%),
+      image("images/church.jpg", width: 60%),
     ),
     caption: "Alan Turing e Alonzo Church",
   )<turing-church>
@@ -3117,14 +3118,69 @@ proposicional pode ser tornada verdadeira* por meio de uma atribuição adequada
         [*Método*],
       ),
 
-      [*_Bubble Sort_*], [$O(n)$], [$O(n^2)$], [$O(n^2)$], [$O(1)$], [Sim], [Troca],
-      [*_Selection Sort_*], [$O(n^2)$], [$O(n^2)$], [$O(n^2)$], [$O(1)$], [Não], [Seleção],
-      [*_Insertion Sort_*], [$O(n)$], [$O(n^2)$], [$O(n^2)$], [$O(1)$], [Sim], [Inserção],
-      [*_Merge Sort_*], [$O(n log n)$], [$O(n log n)$], [$O(n log n)$], [$O(n)$], [Sim], [Intercalação],
-      [*_Quick Sort_*], [$O(n log n)$], [$O(n log n)$], [$O(n^2)$], [$O(log n)$], [Não], [Partição],
-      [*_Heap Sort_*], [$O(n log n)$], [$O(n log n)$], [$O(n log n)$], [$O(1)$], [Não], [Seleção],
-      [*_Counting Sort_*], [$O(n + k)$], [$O(n + k)$], [$O(n + k)$], [$O(n + k)$], [Sim], [Contagem],
-      [*_Radix Sort_*], [$O(n k)$], [$O(n k)$], [$O(n k)$], [$O(n + k)$], [Sim], [Dígito],
+      [*_Bubble Sort_*],
+      [$O(n)$],
+      [$O(n^2)$],
+      [$O(n^2)$],
+      [$O(1)$],
+      [Sim],
+      [Troca],
+
+      [*_Selection Sort_*],
+      [$O(n^2)$],
+      [$O(n^2)$],
+      [$O(n^2)$],
+      [$O(1)$],
+      [Não],
+      [Seleção],
+
+      [*_Insertion Sort_*],
+      [$O(n)$],
+      [$O(n^2)$],
+      [$O(n^2)$],
+      [$O(1)$],
+      [Sim],
+      [Inserção],
+
+      [*_Merge Sort_*],
+      [$O(n log n)$],
+      [$O(n log n)$],
+      [$O(n log n)$],
+      [$O(n)$],
+      [Sim],
+      [Intercalação],
+
+      [*_Quick Sort_*],
+      [$O(n log n)$],
+      [$O(n log n)$],
+      [$O(n^2)$],
+      [$O(log n)$],
+      [Não],
+      [Partição],
+
+      [*_Heap Sort_*],
+      [$O(n log n)$],
+      [$O(n log n)$],
+      [$O(n log n)$],
+      [$O(1)$],
+      [Não],
+      [Seleção],
+
+      [*_Counting Sort_*],
+      [$O(n + k)$],
+      [$O(n + k)$],
+      [$O(n + k)$],
+      [$O(n + k)$],
+      [Sim],
+      [Contagem],
+
+      [*_Radix Sort_*],
+      [$O(n k)$],
+      [$O(n k)$],
+      [$O(n k)$],
+      [$O(n + k)$],
+      [Sim],
+      [Dígito],
     )
   ]
 ]

diff --git a/slides/slides.typ b/slides/slides.typ
@@ -65,7 +65,8 @@ Blank space can be filled with vertical spaces like #v(1fr).
     grid(
       columns: 2,
       gutter: 2mm,
-      image("images/turing.jpg", width: 60%), image("images/church.jpg", width: 60%),
+      image("images/turing.jpg", width: 60%),
+      image("images/church.jpg", width: 60%),
     ),
     caption: "Alan Turing and Alonzo Church",
   )<turing-church>
@@ -2159,10 +2160,15 @@ subtrees is at most 1.
       align: left + horizon,
       table.header([*Characteristic*], [*BFS*], [*DFS*]),
       [*Data Structure*], [Queue], [Stack],
-      [*Memory Usage*], [Higher (stores all neighbors)], [Lower (stores only current path)],
+      [*Memory Usage*],
+      [Higher (stores all neighbors)],
+      [Lower (stores only current path)],
+
       [*Shortest Path*], [Yes (in unweighted graphs)], [Not necessarily],
       [*Completeness*], [Yes], [Yes],
-      [*Applications*], [Shortest path, node levels], [Cycle detection, topological sorting],
+      [*Applications*],
+      [Shortest path, node levels],
+      [Cycle detection, topological sorting],
     )
   ]
 ]
@@ -3090,14 +3096,69 @@ subtrees is at most 1.
         [*Method*],
       ),
 
-      [*Bubble Sort*], [$O(n)$], [$O(n^2)$], [$O(n^2)$], [$O(1)$], [Yes], [Exchange],
-      [*Selection Sort*], [$O(n^2)$], [$O(n^2)$], [$O(n^2)$], [$O(1)$], [No], [Selection],
-      [*Insertion Sort*], [$O(n)$], [$O(n^2)$], [$O(n^2)$], [$O(1)$], [Yes], [Insertion],
-      [*Merge Sort*], [$O(n log n)$], [$O(n log n)$], [$O(n log n)$], [$O(n)$], [Yes], [Merge],
-      [*Quick Sort*], [$O(n log n)$], [$O(n log n)$], [$O(n^2)$], [$O(log n)$], [No], [Partition],
-      [*Heap Sort*], [$O(n log n)$], [$O(n log n)$], [$O(n log n)$], [$O(1)$], [No], [Selection],
-      [*Counting Sort*], [$O(n + k)$], [$O(n + k)$], [$O(n + k)$], [$O(n + k)$], [Yes], [Counting],
-      [*Radix Sort*], [$O(n k)$], [$O(n k)$], [$O(n k)$], [$O(n + k)$], [Yes], [Digit],
+      [*Bubble Sort*],
+      [$O(n)$],
+      [$O(n^2)$],
+      [$O(n^2)$],
+      [$O(1)$],
+      [Yes],
+      [Exchange],
+
+      [*Selection Sort*],
+      [$O(n^2)$],
+      [$O(n^2)$],
+      [$O(n^2)$],
+      [$O(1)$],
+      [No],
+      [Selection],
+
+      [*Insertion Sort*],
+      [$O(n)$],
+      [$O(n^2)$],
+      [$O(n^2)$],
+      [$O(1)$],
+      [Yes],
+      [Insertion],
+
+      [*Merge Sort*],
+      [$O(n log n)$],
+      [$O(n log n)$],
+      [$O(n log n)$],
+      [$O(n)$],
+      [Yes],
+      [Merge],
+
+      [*Quick Sort*],
+      [$O(n log n)$],
+      [$O(n log n)$],
+      [$O(n^2)$],
+      [$O(log n)$],
+      [No],
+      [Partition],
+
+      [*Heap Sort*],
+      [$O(n log n)$],
+      [$O(n log n)$],
+      [$O(n log n)$],
+      [$O(1)$],
+      [No],
+      [Selection],
+
+      [*Counting Sort*],
+      [$O(n + k)$],
+      [$O(n + k)$],
+      [$O(n + k)$],
+      [$O(n + k)$],
+      [Yes],
+      [Counting],
+
+      [*Radix Sort*],
+      [$O(n k)$],
+      [$O(n k)$],
+      [$O(n k)$],
+      [$O(n + k)$],
+      [Yes],
+      [Digit],
     )
   ]
 ]