zeusofthecrows / comp110-worksheet-c

Base repository for COMP110 worksheet C

a) It checks if a list contains a duplicate.

b) Because if the list contains no duplicates, it will have to run through the second again for every additional element.

c) Because the second duplicate item's iteration will always catch the fact that it matched the first.

d) Because on average, it will only go through just under two-thirds of the iterations (1+2+3...+n instead of n^2).

e) Yes. It's closer to triangular time, but as big O notation is always an upper bound it would still be O(n^2).

f) O(n log n). Source: The Python Wiki.

g) O(n log n). The algorithm itself should run at O(n), but it's limited by the complexity of the .sort() function.

h) The latter. O(n log n) should run faster than O(n²) for large sample sizes.

i) I can't think of an answer to this and nobody I talked to can either. The only thing I can think of is the typo in the second procedure - using the var "list" instead of "sortedList"?