Interested to Buy Any Domain ? << Click Here >> for more details...
What are the complexities of sorting algorithms and how can this complexity be calculated?
- 0 Answers
- 958 Views
- Tech Mahindra, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.
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.
What is breadth-first search algorithm?
What is depth-first search algorithm?
What do you mean by overfitting and underfitting algorithms?
Write the Shortest path algorithm for a graph.
What is Back propagation in Neural Networks?
Sorting algorithms and time complexity of various algorithms.
what are the minimum requirements for statr testing?
Tell me how do you choose an algorithm for a classification problem?
Which is the most straight forward approach for planning algorithms?
What is meant by a * search algorithm?
-
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)
