1. What indicates the Big-O value of a given method (or algorithm)?
2. What represent the best-case, average-case and worst-case performance of an algorithm? Choose a common method studied in the prerequisite courses (for example searching for a given value in an array, adding a value to a linked list or to an array, etc.) and indicate the Big-O value for the best-case, average-case and worst-case. Give reasons for these values.
3. Consider the following statement: "Given the speed of today's processors and the low costs of memory, we shouldn't care about algorithm complexity". Do you agree? Give reasons for the answer.