3.6. Exercises

3.6.1. Mandatory exercises

  • Exercise 4: Randomised testing of a sorting procedure.
  • Exercise 5: Finding elements in a given range of the keys in an unsorted array.
  • Exercise 6: Binary sort that does not treat the middle element specially.
  • Exercise 7: Implement and analyse the exponential search.
  • Exercise 8: Merge sort with a single auxiliary array.
  • Exercise 10: Index sort.