Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 1701 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?
A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
list the types of linked list with aid of diagram?
Explain the concept behind dead lock avoidance, banker's algorithm.
0 Answers HPCL, Hughes Systique Corporation,
Given a sorted array of n integers that has been rotated i(unknown) number of times, give a (log n) algorithm that finds an element in the array.
Give a general algorithm for converting a m-array tree to a 2-ary tree.
What is meant by uniform cost search algorithm?
A* algorithm is based on which search method?
Which algorithm inverts a complete resolution strategy?
What was deep learning, & how does it contrast with other machine learning algorithms?
Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?
Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.
-
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)
