Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,

---

What’s your favorite algorithm, & can you explain it into me in less than a minute?

0 Answers  

---

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.

1 Answers  

---

What is the depth-first search algorithm?

0 Answers  

---

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  

---

what are the minimum requirements for statr testing?

0 Answers   QA,

---

Which algorithm is used for solving temporal probabilistic reasoning?

0 Answers  

---

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.

0 Answers  

---

What are the disadvantages of depth-first search algorithm?

0 Answers  

---

Which algorithm in ‘unification and lifting’ takes two sentences and returns a unifier?

0 Answers  

---

Tell us how will you know which machine learning algorithm to choose for your classification problem?

0 Answers  

---

How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?

0 Answers  

---