<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0">
    <channel>
      <title>🎓 CS × DS Vault</title>
      <link>https://xw675.github.io/cs-ds-notes</link>
      <description>Last 10 notes on 🎓 CS × DS Vault</description>
      <generator>Quartz -- quartz.jzhao.xyz</generator>
      <item>
    <title>FIT2004_MOC</title>
    <link>https://xw675.github.io/cs-ds-notes/10_Units/FIT2004_MOC</link>
    <guid>https://xw675.github.io/cs-ds-notes/10_Units/FIT2004_MOC</guid>
    <description><![CDATA[ 📘 FIT2004: Algorithms and Data Structures Map of Content Index for FIT2004 Algorithms and Data Structures (Y2S1) — rigorous algorithmics building on FIT1008_MOC. ]]></description>
    <pubDate>Thu, 13 Aug 2026 05:58:40 GMT</pubDate>
  </item><item>
    <title>2D Local Maximum (Peak Finding)</title>
    <link>https://xw675.github.io/cs-ds-notes/20_Concepts/2D-Local-Maximum-(Peak-Finding)</link>
    <guid>https://xw675.github.io/cs-ds-notes/20_Concepts/2D-Local-Maximum-(Peak-Finding)</guid>
    <description><![CDATA[ 2D Local Maximum (Peak Finding) Context: FIT2004_MOC · Applied 2 Problem 6 — the Divide and Conquer exercise where the naive halving is not aggressive enough, and the correctness argument (not the code) carries the marks. ]]></description>
    <pubDate>Thu, 13 Aug 2026 05:58:40 GMT</pubDate>
  </item><item>
    <title>Analysing Recursive Algorithms (Time and Auxiliary Space)</title>
    <link>https://xw675.github.io/cs-ds-notes/20_Concepts/Analysing-Recursive-Algorithms-(Time-and-Auxiliary-Space)</link>
    <guid>https://xw675.github.io/cs-ds-notes/20_Concepts/Analysing-Recursive-Algorithms-(Time-and-Auxiliary-Space)</guid>
    <description><![CDATA[ Analysing Recursive Algorithms (Time and Auxiliary Space) Context: FIT2004_MOC · the Week 1 lecture-2 spine — pseudocode ➔ recurrence ➔ complexity — and the half Solving Recurrences (Telescoping) does not own: reading auxiliary space off the same recursion Parent Framework: Recursion Quick Revision ... ]]></description>
    <pubDate>Thu, 13 Aug 2026 05:58:40 GMT</pubDate>
  </item><item>
    <title>Counting Inversions</title>
    <link>https://xw675.github.io/cs-ds-notes/20_Concepts/Counting-Inversions</link>
    <guid>https://xw675.github.io/cs-ds-notes/20_Concepts/Counting-Inversions</guid>
    <description><![CDATA[ Counting Inversions Context: FIT2004_MOC · Applied 2 Problem 5 — the unit’s flagship “adapt a paradigm to a NEW problem” exercise (Divide and Conquer LO1): Merge Sort’s combine step is repurposed to count rather than merely order. ]]></description>
    <pubDate>Thu, 13 Aug 2026 05:58:40 GMT</pubDate>
  </item><item>
    <title>Divide and Conquer</title>
    <link>https://xw675.github.io/cs-ds-notes/20_Concepts/Divide-and-Conquer</link>
    <guid>https://xw675.github.io/cs-ds-notes/20_Concepts/Divide-and-Conquer</guid>
    <description><![CDATA[ Divide and Conquer Context: FIT1008_MOC, FIT2004_MOC · a recursive strategy · powers Binary Search, Merge Sort, Quick Sort · solves the Sorting Problem FIT2004 use: the examinable examples are Merge Sort and Quick Sort; every D&amp;C algorithm’s running time is found by solving the cost recurrence T... ]]></description>
    <pubDate>Thu, 13 Aug 2026 05:58:40 GMT</pubDate>
  </item><item>
    <title>FIT2004 Unit Cheatsheet</title>
    <link>https://xw675.github.io/cs-ds-notes/20_Concepts/FIT2004-Unit-Cheatsheet</link>
    <guid>https://xw675.github.io/cs-ds-notes/20_Concepts/FIT2004-Unit-Cheatsheet</guid>
    <description><![CDATA[ FIT2004 Unit Cheatsheet Context: FIT2004_MOC · the WHOLE unit in one re-read, syllabus-ordered. ]]></description>
    <pubDate>Thu, 13 Aug 2026 05:58:40 GMT</pubDate>
  </item><item>
    <title>Fibonacci Sequence</title>
    <link>https://xw675.github.io/cs-ds-notes/20_Concepts/Fibonacci-Sequence</link>
    <guid>https://xw675.github.io/cs-ds-notes/20_Concepts/Fibonacci-Sequence</guid>
    <description><![CDATA[ Fibonacci Sequence Context: FIT1058_MOC, FIT2004_MOC · a two-term recurrence with no obvious closed form · bounded by Mathematical Induction · closed form built from a quadratic’s roots FIT2004 use: §4 and the Proof Blueprint (Applied 2 P7) — the matrix identity and the doubling identities that turn... ]]></description>
    <pubDate>Thu, 13 Aug 2026 05:58:40 GMT</pubDate>
  </item><item>
    <title>Merge Sort</title>
    <link>https://xw675.github.io/cs-ds-notes/20_Concepts/Merge-Sort</link>
    <guid>https://xw675.github.io/cs-ds-notes/20_Concepts/Merge-Sort</guid>
    <description><![CDATA[ Merge Sort Context: FIT1008_MOC · a Divide and Conquer sort · solves the Sorting Problem · uses an Auxiliary Function (Recursion) · contrast with Quick Sort · the merge step generalises from 2 to k lists in K-way Merge FIT2004 use: the merge is also an instrumentation point — threading a counter thr... ]]></description>
    <pubDate>Thu, 13 Aug 2026 05:58:40 GMT</pubDate>
  </item><item>
    <title>Solving Recurrences (Telescoping)</title>
    <link>https://xw675.github.io/cs-ds-notes/20_Concepts/Solving-Recurrences-(Telescoping)</link>
    <guid>https://xw675.github.io/cs-ds-notes/20_Concepts/Solving-Recurrences-(Telescoping)</guid>
    <description><![CDATA[ Solving Recurrences (Telescoping) Context: FIT2004_MOC · turning a recursive algorithm’s cost recurrence T(n) into a Big-O bound · the analysis half of Divide and Conquer (the maths of Recurrence Relation applied to running time) Upstream and downstream: getting the recurrence out of the code, and t... ]]></description>
    <pubDate>Thu, 13 Aug 2026 05:58:40 GMT</pubDate>
  </item><item>
    <title>Counting Sort</title>
    <link>https://xw675.github.io/cs-ds-notes/20_Concepts/Counting-Sort</link>
    <guid>https://xw675.github.io/cs-ds-notes/20_Concepts/Counting-Sort</guid>
    <description><![CDATA[ Counting Sort Context: FIT2004_MOC · the first non-comparison sort — tally keys in an index-addressed array instead of comparing them · the stable subroutine Radix Sort is built from · contrast the \Omega(N\log N) comparison floor in Sorting Problem Quick Revision 🎯 Objective: use each key as an ar... ]]></description>
    <pubDate>Thu, 13 Aug 2026 02:59:39 GMT</pubDate>
  </item>
    </channel>
  </rss>