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

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

0 Answers   Tech Mahindra,

---

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?

1 Answers   IBM, TCS,

---

Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,

---

can anyone help me with some suggestions and improvemnts for sage line 50?

0 Answers  

---

What is bidirectional search algorithm?

0 Answers  

---

Define Routing Algorithm?

0 Answers   Maveric,

---

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

0 Answers  

---

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

0 Answers  

---

Tell briefly about the Banker's algorithm and what is it used for?

0 Answers   Impetus,

---

Consider the following algorithm, where the array A is indexed 1 through n: int add_them ( int n , int A[ ] ) { index i , j , k ; j = 0 ; for ( i = 1 ; i <= n ; i++) j = j + A[i] ; k = 1 ; for ( i = 1 ; i <= n ; i++) k = k + k ; return j + k ; } (a) If n = 5 and the array A contains 2, 5, 3, 7, and 8, what is returned? (b) What is the time complexity T(n) of the algorithm?

0 Answers  

---

What is informed (heuristic) search strategies algorithm?

0 Answers  

---

What is local search algorithms?

0 Answers  

---