update R6 and rebuild

2025-09-28 23:52:11 +09:00
parent fc1f4447ab
commit 3b64e288ab
8 changed files with 10 additions and 10 deletions
--- a/out/reviews/R1.pdf
+++ b/out/reviews/R1.pdf
--- a/out/reviews/R2.pdf
+++ b/out/reviews/R2.pdf
--- a/out/reviews/R3.pdf
+++ b/out/reviews/R3.pdf
--- a/out/reviews/R4-1.pdf
+++ b/out/reviews/R4-1.pdf
--- a/out/reviews/R4-2.pdf
+++ b/out/reviews/R4-2.pdf
--- a/out/reviews/R5.pdf
+++ b/out/reviews/R5.pdf
--- a/out/reviews/R6.pdf
+++ b/out/reviews/R6.pdf
--- a/reviews/R6.md
+++ b/reviews/R6.md
@@ -65,7 +65,7 @@ print(create_array_table(
 ))

 print(create_array_table(
-    [2, 1, 3, 4, 8, 7, 5, 6],
+    [2, 1, 3, 4, 7, 5, 6, 8],
    [0, 0, 1, 1, 0, 0, 0, 1],
    0, 0
 ))
@@ -115,6 +115,6 @@ The best-case occurs when the `PARTITION` partitiend the array balanced, which m

 So, time-complexity of the case is:

-$$T(n) = T(n/2) + O(n)$$
+$$T(n) = T(0) + O(n)$$

 $$\therefore T(n) = O(n)$$