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

Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.

0 Answers   Amazon,

---

What was deep learning, & how does it contrast with other machine learning algorithms?

0 Answers  

---

What is simulated annealing algorithm?

0 Answers  

---

Can you pick an algorithm. Write the psuedo-code for a parallel implementation?

0 Answers  

---

How does deep learning contrast with other machine learning algorithms?

0 Answers  

---

Draw a flowchart to find the average of four number?

0 Answers  

---

Define Routing Algorithm?

0 Answers   Maveric,

---

Explain the concept behind dead lock avoidance, banker's algorithm.

0 Answers   HPCL, Hughes Systique Corporation,

---

What is the depth-first search algorithm?

0 Answers  

---

what is software cycle?give a diagramatic representation

0 Answers  

---

Which algorithm inverts a complete resolution strategy?

0 Answers  

---

Give a general algorithm for converting a m-array tree to a 2-ary tree.

0 Answers   Tech Mahindra,

---