descriptions, minor

7 files changed, 9 insertions, 5 deletions

diff --git a/content/1_Intro/Practicing.mdx b/content/1_Intro/Practicing.mdx
index 7c83e10..806c39c 100644
--- a/content/1_Intro/Practicing.mdx
+++ b/content/1_Intro/Practicing.mdx
@@ -78,6 +78,8 @@ I'm impatient, so usually I go with the first option. Sometimes I end up reading
 
 In any case, if you thought about a problem a lot during a contest but didn't end up solving it, then I don't see any reason not to read the editorial when it comes out (vs. continuing to think about it on your own). Also, you should always implement the solution afterwards!
 
+You can also check my [Github](https://github.com/bqi343/USACO/blob/master/Resources/Solving%20Problems.md) and my [IOI interview](https://ioinformatics.org/interview/interview-benjamin-qi/27?event=july-2020).
+
 ## Nathan Chen
 
 Read the editorial when you feel like you've stopped making progress; that could be from 1 to 5 hours. However, the most important part about reading the editorial is that you understand the topic and try to think about what similar problems look like. Being generally curious is a good way to practice algorithmic thinking.
diff --git a/content/1_Intro/Tips.mdx b/content/1_Intro/Tips.mdx
index 3ad1c74..0ecb911 100644
--- a/content/1_Intro/Tips.mdx
+++ b/content/1_Intro/Tips.mdx
@@ -2,7 +2,7 @@
 id: cpp-tips
 title: C++ Tips & Tricks
 author: Benjamin Qi
-description: "Things you should know about my template."
+description: "Explaining various parts of Ben's template."
 ---
 
 ## `#include <bits/stdc++.h>`
diff --git a/content/3_Silver/Binary_Search_Sorted.mdx b/content/3_Silver/Binary_Search_Sorted.mdx
index 49099d0..0e09690 100644
--- a/content/3_Silver/Binary_Search_Sorted.mdx
+++ b/content/3_Silver/Binary_Search_Sorted.mdx
@@ -2,7 +2,7 @@
 id: binary-search-sorted
 title: "Binary Search on a Sorted Array"
 author: Siyong Huang, Michael Cao, Nathan Chen
-description: "Using binary search to find elements quickly in a sorted array."
+description: "Quickly finding elements in a sorted array."
 prerequisites:
  - intro-ds
 frequency: 2
diff --git a/content/3_Silver/Greedy.mdx b/content/3_Silver/Greedy.mdx
index 9fd956d..5fb4129 100644
--- a/content/3_Silver/Greedy.mdx
+++ b/content/3_Silver/Greedy.mdx
@@ -1,6 +1,6 @@
 ---
 id: greedy
-title: "Greedy Algorithms with Sorting"
+title: "Greedy Algorithms involving Sorting"
 author: Darren Yao
 prerequisites: 
  - intro-greedy
diff --git a/content/3_Silver/Intro_Ordered.mdx b/content/3_Silver/Intro_Ordered.mdx
index 20637a9..638eb40 100644
--- a/content/3_Silver/Intro_Ordered.mdx
+++ b/content/3_Silver/Intro_Ordered.mdx
@@ -4,7 +4,7 @@ title: "Introduction to Ordered Sets"
 author: Darren Yao, Benjamin Qi
 prerequisites: 
  - unordered
-description: "Data structures that maintain keys in sorted order."
+description: "By maintaining keys in sorted order."
 frequency: 2
 ---
 
diff --git a/content/3_Silver/Unordered.mdx b/content/3_Silver/Unordered.mdx
index 073fd5b..f530ad8 100644
--- a/content/3_Silver/Unordered.mdx
+++ b/content/3_Silver/Unordered.mdx
@@ -2,7 +2,7 @@
 id: unordered
 title: Unordered Maps & Sets
 author: Darren Yao, Benjamin Qi
-description: "?"
+description: "With hashing."
 frequency: 2
 prerequisites:
  - pairs-tuples
diff --git a/content/ordering.ts b/content/ordering.ts
index 275bac8..8127c31 100644
--- a/content/ordering.ts
+++ b/content/ordering.ts
@@ -21,6 +21,7 @@ const MODULE_ORDERING: {[key in SectionID]: Chapter[]} = {
     },
     {
       name: "Getting Started",
+      description: "Start here if you're new to competitive programming.",
       items: [
         "intro",
         "choosing-lang",
@@ -118,6 +119,7 @@ const MODULE_ORDERING: {[key in SectionID]: Chapter[]} = {
     },
     {
       name: "Sets & Maps",
+      description: "Maintaining collections of distinct elements.",
       items: [
         "unordered",
         "intro-ordered",