Chapter 14

1. What is an algorithm?

   A predefined set of computer instructions that complete a specific task.

2. How is pseudocode used with algorithms?

   Pseudocode is often used to present an algorithm in a language agnostic manner.

3. What does O(1) mean?

   Constant time complexity.

4. What is a more efficient time complexity: O(n*log(n)) or O(n^2)?

   O(n*log(n))

5. How does merge sort work?

   Merge sort uses a divide and conquer methodology.

6. Which is more efficient: bubble sort or merge sort?

   Merge sort.

7. For an array (0..238), how do you retrieve the first element in the array?

   Access element 0.

8. For an array (1..299), how do you retrieve the last element in the array?

   Access element 299.

9. How do you calculate the number of elements in an array?

   SIZEOF(Array)/SIZEOF(Array[1])

10. Name three sorting algorithms.
    • Bubble sort
    • Merge sort
    • Insertion sort
11. Name three areas where an algorithm can be used.
    • AI/Machine Learning
    • Security
    • Sorting
    • Encryption/decryption