Part I
Suppose you have the following sequence of runtime for an operation: 3, 6, 11, 18, 27, 38,…
- List the next 2 elements in the sequence.
- Determine the general equation that yields results for any element of the sequence.
- What is the runtime for matrix multiplication operations in terms of big-O notation?
Part II
Suppose you have the following array of data: {4, 5, 7, 11, 20, 24, 31, 35, 40, 45, 50}.
- Explain how you precede a sequential search of an array.
- Apply your method of search to the given array to locate the element of number 11.
- Clearly indicate whether or not the element was found and its index (location) within the array.
- Apply your method of search to the given array to locate the element of number 13.
- Clearly indicate whether or not the element was found and its index (location) within the array.
- What is the best-case runtime and the worst-case runtime of an array of size n?
Part III
Suppose you have the following array of data: {4, 5, 7, 11, 20, 24, 31, 35, 40, 45, 50}.
- Explain how you precede a binary search of an array.
- Apply your method of search to the given array to locate the element of number 11.
- Clearly indicate whether or not the element was found and its index (location) within the array.
- Apply your method of search to the given array to locate the element of number 13.
- Clearly indicate whether or not the element was found and its index (location) within the array.
- What is the worst-case runtime of an array of size n?
0 comments