A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
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.
Sorting algorithms and time complexity of various algorithms.
Draw a flowchart to find the average of four number?
What is breath-first search algorithm?
Name search algorithm technology?
Write the Shortest path algorithm for a graph.
Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
What is depth-first search algorithm?
How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?
what are the minimum requirements for statr testing?
There are numbers from 1 to n, which are inverted such that it results in numbers from n to 1. If only two consecutive numbers are stampled at a time and are inverted, how many moves are required?
What is informed (heuristic) search strategies 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)