Rubric

Find Rubric
Keep in mind that 59 students have already been assessed using this rubric. Changing it will affect their evaluations.
Some Rubric (3)
Some Rubric (3)
Criteria Ratings Pts
Correctly compute kth smallest, regardless of time complexity
threshold: pts
7.0 pts
Full Marks
0.0 pts
No Marks
pts
7.0 pts
--
Base case of recursive function is correct
threshold: pts
5.0 pts
Full Marks
0.0 pts
No Marks
pts
5.0 pts
--
Recursive case of recursive function is correct
threshold: pts
6.0 pts
Full Marks
0.0 pts
No Marks
pts
6.0 pts
--
Time complexity is just O(lg n), property maintain counts within the tree nodes
threshold: pts
2.0 pts
Full Marks
0.0 pts
No Marks
pts
2.0 pts
--
Total Points: 20.0 out of 20.0