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
- 2095 Views
- I also Faced
- E-Mail Answers
can anyone help me with some suggestions and improvemnts for sage line 50?
What is the bidirectional search algorithm?
Explain the Canny's Algorithm.
List the different algorithm techniques in machine learning?
What is the breadth-first search algorithm?
How does deep learning contrast with other machine learning algorithms?
How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?
Which algorithm is used for solving temporal probabilistic reasoning?
What is Back propagation in Neural Networks?
Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.
Can you pick an algorithm. Write the psuedo-code for a parallel implementation?
Sorting algorithms and time complexity of various algorithms.
-
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)
