Courses‎ > ‎AP Computer Science 2‎ > ‎Konstantinovich‎ > ‎

2017-03-21 HW07

posted Mar 20, 2017, 9:28 PM by Samuel Konstantinovich   [ updated Mar 23, 2017, 11:26 AM ]
on Github:
Directory: 
07*/   (e.g. 07Quick)  
  -> Quick.java
  ---> public static void quicksort(int[]ary){...}
  ---> public static int quickselect(int[]ary, int k){...}
Both quicksort and quickselect must work with arrays that contain many duplicates. You must use the dutch flag partitioning to accomplish this. 

To check your assignments go here:

Log in : your default password is your osis.

Median on quiz was  18 points.
Median on take home reduxquiz was 14 points (because it should be)

The following was used to determine your letter grade:
01
02
05
06
The Quiz.
EC01

If you were missing more than 1 item other than the Extra Credit, it got a comment on the report card and a warning letter grade.
Much like SING, without point deductions, you have no incentive to follow the rules.  





Regarding your repo, here is a list of what your repo should look like:
01sqrt
02NQueens
03Knights
04Maze
05USACO
06Quiz
07Quick
EC01
otherstuff  <- any non-numbered directories can be used for your other stuff!





Comments