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

Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?

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  

---

Name search algorithm technology?

0 Answers  

---

Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.

0 Answers   Aspiring Minds,

---

What is breath-first search algorithm?

0 Answers  

---

What do you mean by overfitting and underfitting algorithms?

0 Answers  

---

What are the complexities of sorting algorithms and how can this complexity be calculated?

0 Answers   Tech Mahindra,

---

What is breadth-first search algorithm?

0 Answers  

---

Which language is used for artificial intelligence?

0 Answers   Flextronics,

---

What is meant by a * search algorithm?

0 Answers  

---

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

0 Answers  

---

Draw a flowchart to find the average of four number?

0 Answers  

---