Courses‎ > ‎AP Computer Science 2‎ > ‎konstantinovich‎ > ‎

2018-03-14

posted Mar 14, 2018, 10:23 AM by Konstantinovich Samuel   [ updated Mar 14, 2018, 11:18 AM ]
 Github:
Directory: 
06Quick/
  -> Quick.java
    ---> public static void quicksort(int[]ary){...}
    ---> public static int quickselect(int[]ary, int k){...}

Do Now:
Copy this diagram, then write out the pseudo code for your partition algorithm:

basic partition:



Discussion on better partitioning: (Dutch Flag Problem)
partition with clustering of values equal to the pivot:





Comments