Description

Analyze the worst-case time complexity of the MysteryIncrement algorithm below and show your work. This algorithm increments every element of an array, but does so in an unusual way.

Note that the algorithm assumes that array indexes are 1 to n rather than 0 to n-1. This does not affect the complexity of the algorithm, but it may affect how well you understand what it is doing.

MysteryIncrement

Input:

arr: array of size n

Input:

n: size of arr

Input:

k: positive integer between 1 and n, inclusive

Output:

arr, with all entries incremented by 1

Pseudocode:

1. for i = 1 to k

2. for j = 1 to n/k

3. arr[j * k + i] = arr[j * k + i] + 1

4. end for

5. end for

6. return arr

7:38 9

Assignment Details

COP4530.001821.13506 Data Structures

Description

Analyze the worst-case time complexity of the

Mysterylncrement algorithm below and show

your work. This algorithm increments every

element of an array, but does so in an unusual

way.

Note that the algorithm assumes that array

indexes are 1 to n rather than 0 to n-1. This

does not affect the complexity of the

algorithm, but it may affect how well you

understand what it is doing.

Mysterylncrement

Input: arr: array of size n

Input: n: size of arr

Input: k: positive integer between 1 and n,

inclusive

Output: arr, with all entries incremented by 1

Pseudocode:

1. for i = 1 to k

Submit Assignment

< Previous
Dashboard
Calendar
To Do
Notifications
Inbox
7:38 9
Assignment Details
COP4530.001S21.13506 Data Structures
algorithm, but it may affect how well you
understand what it is doing.
Mysterylncrement
Input: arr: array of size n
Input: n: size of arr
Input: k: positive integer between 1 and n,
inclusive
Output: arr, with all entries incremented by 1
Pseudocode:
1. for i = 1 to k
2. for j= 1 to n/k
3.
arr[j * k + i] = arr[ * k + i] + 1
4. end for
5. end for
6. return arr
Submit Assignment
< Previous
Dashboard
Calendar
To Do
Notifications
Inbox
Purchase answer to see full
attachment