Interested to Buy Any Domain ? << Click Here >> for more details...
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?
- 0 Answers
- 2355 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Which algorithm is used for solving temporal probabilistic reasoning?
Which is the most straight forward approach for planning algorithms?
What are the complexities of sorting algorithms and how can this complexity be calculated?
Write a code/algorithm to find the frequency of each element in an array?
0 Answers ITC Indian Tobacco Company,
What are disadvantages uniform cost search algorithm?
When an algorithm is considered completed?
Which search algorithm will use a limited amount of memory in an online search?
What is informed (heuristic) search strategies algorithm?
What features would you use to build a recommendation algorithm for users?
What do you mean by overfitting and underfitting algorithms?
What is the iterative deepening depth-first search algorithm?
can anyone help me with some suggestions and improvemnts for sage line 50?
-
AI Algorithms (74) - AI Natural Language Processing (96)
- AI Knowledge Representation Reasoning (12)
- AI Robotics (183)
- AI Computer Vision (13)
- AI Neural Networks (66)
- AI Fuzzy Logic (31)
- AI Games (8)
- AI Languages (141)
- AI Tools (11)
- AI Machine Learning (659)
- Data Science (671)
- Data Mining (120)
- AI Deep Learning (111)
- Generative AI (153)
- AI Frameworks Libraries (197)
- AI Ethics Safety (100)
- AI Applications (427)
- AI General (197)
- AI AllOther (6)
