Interested to Buy Any Domain ? << Click Here >> for more details...
1. Consider the following algorithm:
for ( i = 1 ; i <= 1 . 5 n ; i++)
cout << i ;
for ( i = n ; i >= 1 ; i - - )
cout << i ;
(a) What is the output when n = 2, n = 4, and n = 6?
(b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.
- 0 Answers
- 2632 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
what are the minimum requirements for statr testing?
What is the uniform cost search algorithm?
What is meant by uniform cost search algorithm?
Which algorithm is used for solving temporal probabilistic reasoning?
Given a series of positive integers. Design an efficient algorithm that can detect pairs whose sum is equal to K such that K = ei + ej, and (i not equal to j).
Tell us why is naïve bayes machine learning algorithm naïve?
What is simulated annealing algorithm?
Which language is used for artificial intelligence?
Write a code/algorithm to find the frequency of each element in an array?
0 Answers ITC Indian Tobacco Company,
What is Na?ve Bayes Algorithm?
Sorting algorithms and time complexity of various algorithms.
Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
-
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)
