Consider the following algorithm:
for ( i = 2 ; i <= n ; i++) {
for ( j = 0 ; j <= n) {
cout << i << j ;
j = j + floor(n/4) ;
}
}
(a) What is the output when n = 4
(b) What is the time complexity T(n). You may assume that n is divisible 4.
- 0 Answers
- 1286 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
When an algorithm is considered completed?
Tell briefly about the Banker's algorithm and what is it used for?
What is the iterative deepening depth-first search algorithm?
Which is the most straight forward approach for planning algorithm?
Tell us why is naïve bayes machine learning algorithm naïve?
What are the disadvantages of depth-first search algorithm?
Name search algorithm technology?
There are numbers from 1 to n, which are inverted such that it results in numbers from n to 1. If only two consecutive numbers are stampled at a time and are inverted, how many moves are required?
What features would you use to build a recommendation algorithm for users?
What is informed (heuristic) search strategies algorithm?
How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?
Which algorithm is used for solving temporal probabilistic reasoning?
-
AI Algorithms (74) - AI Language Processing (96)
- AI Knowledge Representation (12)
- AI Robotics (183)
- AI Recognition (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)
- TensorFlow (197)
- AI Deep Learning (111)
- AI General (197)
- AI AllOther (6)
