4. Describe the best case, average case, and worst case in terms of Big O Notation. When implementing algorithms or data structures which two Big O cases are most important to consider and why?

5. Bubble Sort and Selection Sort explain the similarities and difference between the two algorithms. What is the Worst Case Big (O) and why?

6. Compare and Contrast C++ to Python programming languages? How do the characteristics of the languages impact the amount of memory each language occupies. How do memory considerations impact each languages real-world implementations?

7. What are the key factors that impact the effectiveness of a sorting algorithm?