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
- 2585 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Draw a flowchart to find the average of four number?
Which is the most straight forward approach for planning algorithm?
Why size of integer depends on the machine architecture then what the best sorting algorithm and why?
0 Answers HPCL, Hughes Systique Corporation,
What is simulated annealing algorithm?
What is the breadth-first search algorithm?
Tell us how will you know which machine learning algorithm to choose for your classification problem?
Write a code/algorithm to find the frequency of each element in an array?
0 Answers ITC Indian Tobacco Company,
What are the complexities of sorting algorithms and how can this complexity be calculated?
What is local search algorithms?
Sorting algorithms and time complexity of various algorithms.
List the different algorithm techniques in machine learning?
Tell briefly about the Banker's algorithm and what is it used for?
-
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)
