COMP225 Practical Exercises for Week 6

  1. Implement FatPartition from the tutorial exercises.
  2. (*) Implement bucket sort from lectures using a dynamic data structure, such as a vector or a linked list to implement the "buckets" rather than an array. If you did not know the possible values of the items beforehand could you adapt your implementation to cope with that? What would the complexity be of your adapted program?

    All enquiries to Annabelle McIver