Reading 02: Searching, Sorting, and Associative Containers

Everyone:

Next week, we will work on problems related to searching, sorting, and associative containers such as sets, maps, and hash tables. Knowing how to apply these techniques will come in handy for Challenge 04, Challenge 05, and Challenge 06.

Reading

The readings for this week are:

  1. Competitive Programmer's Handbook

    • Chapter 3 Sorting

    • Chapter 4 Data Structures

      Focus on sections 4.2 Set structures and 4.3 Map structures.

Optional

Here are some optional resources:

  1. C++ standard library:

  2. Python standard library:

Quiz

Once you have done the readings, answer the following Reading 02 Quiz questions:

Submission

To submit you work, follow the same process outlined in Reading 01:

$ git checkout master                 # Make sure we are in master branch

$ git pull --rebase                   # Make sure we are up-to-date with GitHub

$ git checkout -b reading02           # Create reading02 branch and check it out

$ cd reading02                        # Go into reading02 folder

$ $EDITOR answers.json                # Edit your answers.json file

$ ../.scripts/check.py                # Check reading02 quiz
Checking reading02 quiz ...
     Q01 0.40
     Q02 0.60
     Q03 0.20
     Q04 0.80
     Q05 0.25
     Q06 0.25
     Q07 0.25
     Q08 0.25
     Q09 0.50
     Q10 0.50
   Score 4.00 / 4.00
  Status Success

$ git add answers.json                # Add answers.json to staging area

$ git commit -m "Reading 02: Done"    # Commit work

$ git push -u origin reading02        # Push branch to GitHub

Pull Request

Once you have commited your work and pushed it to GitHub, remember to create a pull request and assign it to the teaching assistant.