Answer Posted / 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 the Canny's Algorithm.

995

---

Which search algorithm will use a limited amount of memory in online search?

1151

---

What is the breadth-first search algorithm?

932

---

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

994

---

list the types of linked list with aid of diagram?

2690

---

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

970

---

Define Routing Algorithm?

1080

---

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.

2697

---

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?

2414

---

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

1007

---

What is software cycle? Give a diagrammatic representation?

908

---

What is meant by a * search algorithm?

973

---

Write a code/algorithm to find the frequency of each element in an array?

943

---

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

1018

---

Sorting algorithms and time complexity of various algorithms.

1021

---