COMP225 Practical Exercises for Week 7

  1. (*) Implement the function to compute L[] from the tutorial exercises. Next use it to solve the longest increasing subsequence. How can you adjust your program so that it computes the actual longest increasing subsequence?
  2. Try implementing radixSort from lectures for sorting numbers in base 3 with three digits. Incorporate the optimisation from the tutorial exercises.

    All enquiries to Annabelle McIver