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
- 1449 Views
- I also Faced
- E-Mail Answers
What is breath-first search algorithm?
What are the disadvantages of breadth-first search algorithm?
What is the most efficient way to store 1 million phone numbers memory-wise?
What is meant by a * search algorithm?
what are the minimum requirements for statr testing?
What are the disadvantages of depth-first search algorithm?
Sorting algorithms and time complexity of various algorithms.
A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
What is the depth-first search algorithm?
Why size of integer depends on the machine architecture then what the best sorting algorithm and why?
0 Answers HPCL, Hughes Systique Corporation,
How does deep learning contrast with other machine learning algorithms?
Consider the following algorithm: j = 1 ; while ( j <= n/2) { i = 1 ; while ( i <= j ) { cout << j << i ; i++; } j++; } (a) What is the output when n = 6, n = 8, and n = 10? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.
-
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)
