As a teacher I add students to my folder as collaborators. If I want to make sure they are all in, I read my enrolment which is in sensible alphabetical order and have to check each name presence in "share list" in Box which is unsorted. This algorithm is O(n^2). If Box "shared list was sorted" it would be O(2*n). For 20 students that is difference between 400 and 40 compares. --thank you [add new category-- Usability]