Answer / venomvendor

Answer is

Sigma(count), where count ranges from [1 to {n-(swap per time -1)}]

n-(swap per time - 1)
Σ i
i=1

Image Notation >> http://imgur.com/6HkcXzP

In this case.
n = n
swap per time = 2

Substituting this, we get

n-(2 - 1)
Σ i
i=1

n-1
Σ i
i=1

1+2+3+ . . . + (n-1)

if n = 5
Total swaps would be

1+2+3+4 = 10

Can you list some use cases where classification machine learning algorithms can be used?

0 Answers  

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

What is the uniform cost search algorithm?

0 Answers  

---

Which is the most straight forward approach for planning algorithms?

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  

---

When an algorithm is considered completed?

0 Answers  

---

What features would you use to build a recommendation algorithm for users?

0 Answers   Twitter,

---

Tell us why is naïve bayes machine learning algorithm naïve?

0 Answers  

---

What is the depth-first search algorithm?

0 Answers  

---

What is greedy best first search algorithm?

0 Answers  

---

What is Na?ve Bayes Algorithm?

2 Answers  

---

what is software cycle?give a diagramatic representation

0 Answers  

---