Reading 05: Sorting

Everyone:

Next week, we will study various sorting algorithms, including: bubble sort, selection sort, insertion sort, merge sort, and quick sort. During our exploration, we will also be introduced to the divide-and-conquer approach to problem solving.

TL;DR

The focus of this reading is sorting algorithms.

Readings

The readings for this week are:

  1. Data Structures Handbook

  2. Learn DS & Algorithms

Optional References

  1. Interview Cake

Quiz

Once you have completed the readings, answer the following Reading 05 Quiz questions:

Submission

To submit your 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 reading05           # Create reading05 branch and check it out

$ cd reading05                        # Go into reading05 folder
$ $EDITOR answers.json                # Edit your answers.json file

$ ../.scripts/check.py                # Check reading05 quiz
Checking reading05 quiz ...
      Q1 0.40
      Q2 0.60
      Q3 0.50
      Q4 0.50
      Q5 0.50
      Q6 0.50
   Score 3.00 / 3.00
  Status Success

$ git add answers.json                # Add answers.json to staging area
$ git commit -m "Reading 05: Done"    # Commit work

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

Pull Request

Once you have committed your work and pushed it to GitHub, remember to create a pull request and assign it to the appropriate teaching assistant from the Reading 05 TA List.