• View
• Edit
• History
• Print

10F-Lab7

recursion over binary tree

difficult recursion problem (possibly the arrangements/permutation problem)

performance experiments (they do not need to write a lot of code for this) that compares binary search with linear, selection/insertion sort with quicksort

plot performance