Consider the following algorithm, where the array A is indexed 1 through n:
int add_them ( int n , int A[ ] ) {
index i , j , k ;
j = 0 ;
for ( i = 1 ; i <= n ; i++)
j = j + A[i] ;
k = 1 ;
for ( i = 1 ; i <= n ; i++)
k = k + k ;
return j + k ;
}
(a) If n = 5 and the array A contains 2, 5, 3, 7, and 8, what is returned?
(b) What is the time complexity T(n) of the algorithm?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More AI Algorithms Interview Questions

Consider the following algorithm: j = 1 ; while ( j <= n/2) { i = 1 ; while ( i <= j ) { cout << j << i ; i++; } j++; } (a) What is the output when n = 6, n = 8, and n = 10? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

1 Answers  


What is simulated annealing algorithm?

0 Answers  


Which search algorithm will use a limited amount of memory in online search?

0 Answers  


Give a general algorithm for converting a m-array tree to a 2-ary tree.

0 Answers   Tech Mahindra,


When an algorithm is considered completed?

0 Answers  






Name search algorithm technology?

0 Answers  


Which search algorithm will use a limited amount of memory in an online search?

0 Answers  


Which is the most straight forward approach for planning algorithms?

0 Answers  


Given a sorted array of n integers that has been rotated i(unknown) number of times, give a (log n) algorithm that finds an element in the array.

0 Answers   Expedia,


What is iterative deepening depth-first search algorithm?

0 Answers  


What is the depth-first search algorithm?

0 Answers  


Can you list some use cases where classification machine learning algorithms can be used?

0 Answers  


Categories