edits + added extra resources

Author: mcloughlan

.gitattributes

@@ -2,5 +2,4 @@
 docs/** linguist-documentation=false 
 
 # This whole project is especially markdown based. It's worth showing that
-*.md linguist-detectable=true
-*.md linguist-documentation=false 
+*.md linguist-detectable=true

docs/algorithms.md

@@ -1055,7 +1055,7 @@ Examples:
 
 <sup>Not actually in the study design</sup>
 
-In terms of "Big O"/worst case space complexity, the space complexity is the auxiliary space occupied by the algorithm. Which does not include the input.
+In terms of "Big O"/worst case space complexity, the space complexity is the auxiliary space occupied by the algorithm. Which does not include the input or the output.
 
 See a conversation between myself and [Sebastian Sardina](https://www.rmit.edu.au/contact/staff-contacts/academic-staff/s/sardina-professor-sebastian):
 
@@ -1213,7 +1213,7 @@ Given lower bound $a$ and upper bound $b$, calculate the mid (average) value $c$
 
 Yeah this took you a while to realise. Pascals triangle is a seating plan for combinations.
 
-```python
+```python title="Pascal's triangle in Python"
 from math import comb
 
 for i in range(0, 11):
@@ -1229,8 +1229,7 @@ These are also the coefficients to $(x+1)^n$ where $n$ is the row in Pascal's tr
 
 ## Artificial Intelligence (AI)
 
-- "*The intelligence exhibited by machines or software*"
-- 
+> "*The intelligence exhibited by machines or software*"
 
 ### Intelligence
 
@@ -1337,8 +1336,7 @@ To which Searle responded
 
 To which Searle responded
 
-- You're stupid. ffs, this is literally just adding more inputs and outputs. It still doesn't understand
-	- He didn't swear, I paraphrased - From 2024 Freddy
+- You're stupid. This is literally just adding more inputs and outputs. It still doesn't understand
 
 ##### The Brain Simulator Argument
 
@@ -1391,14 +1389,16 @@ Essentially, it takes several inputs and multiplies them by their bias to be mat
 Which can be formulated with
 
 $$
-{\displaystyle f(\mathbf {x} )={\begin{cases}1&{\text{if }}\ \mathbf {w} \cdot \mathbf {x} +b>0,\\
+{\displaystyle f(\mathbf {x} )={\begin{cases}1&{\text{if }}\ \mathbf {w} \cdot \mathbf {x} +b>0,\newline
 0&{\text{otherwise}}\end{cases}}}
 $$
 
-$$\text{or}$$
+$$
+\text{or}
+$$
 
 $$
-{\displaystyle f(\mathbf {x} )={\begin{cases}1&{\text{if }}\ \mathbf {\displaystyle \sum _{i=1}^{m}w_{i}x_{i}}+b>0,\\
+{\displaystyle f(\mathbf {x} )={\begin{cases}1&{\text{if }}\ \mathbf {\displaystyle \sum_{i=1}^{m}w_{i}x_{i}}+b>0,\newline
 0&{\text{otherwise}}\end{cases}}}
 $$
 

docs/extra-resources.md

@@ -0,0 +1,12 @@
+---
+icon: material/book-search
+---
+
+
+# Extra Resources
+
+## Study score scaling
+
+[https://www.tsfx.edu.au/vce/edge-online/the-study-score-predictor-technology-subjects/](https://www.tsfx.edu.au/vce/edge-online/the-study-score-predictor-technology-subjects/)
+
+Although it's a bit out of date, this site shows how your exam performace (%) correlates with your raw and scaled study score

docs/index.md

@@ -8,6 +8,8 @@
 
 Pull requests are welcome! Please see [the repository](https://github.com/mcloughlan/algo-notes)
 
+If you are studying some non-VCE type of 'algorithms and analysis' this site will still be helpful, but keep in mind that the bulk of this website is designed for VCE students.
+
 !!! warning New study design
 
 	I removed the outdated content from before 2023 (the old study design), but there may be implicit references to it in other current content

mkdocs.yml

@@ -26,9 +26,14 @@ extra_javascript:
   - https://cdn.jsdelivr.net/npm/[email protected]/dist/katex.min.js
   - https://cdn.jsdelivr.net/npm/[email protected]/dist/contrib/auto-render.min.js
   - js/math.js
-
 extra_css:
   - https://cdn.jsdelivr.net/npm/[email protected]/dist/katex.min.css
+nav:
+  - Home: index.md
+  - Algorithms: algorithms.md
+  - Graphs: graphs.md
+  - Computer Science: computer-science.md
+  - Extra Resources: extra-resources.md
 markdown_extensions:
   - admonition
   - pymdownx.details