6. The algorithm with O(n²) will always be slower than the algorithm with O(n) no matter how small n becomes. True False

7. In determining Big O of a growth-rate function, you can do the following except for: No answer is correct O(f(n)) + O(g(n)) = O(f(n) + g(n)) ignore low-order terms ignore multiplicative constant in high-order term

8. Average case analysis is easier than worst case analysis True False

9. Linked-list tends to be inefficient but you would probably use it for: retrieving a lot but rarely inserting and removing All answers are correct inserting and removing items frequently but rarely retrieving small lists

10. Sequential search is good for small lists True False