update R6 and rebuild

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)$$