Now a cycle with 2 nodes will only require 1 swap to reach the correct ordering, similarly, a cycle with 3 nodes will only require 2 swaps to do so.

If the number of observations is odd, the number in the middle of the list is the median. This can be found by taking the value of the (n+1)/2 -th term, where n is the number of observations. Else, if the number of observations is even, then the median is the simple average of the middle two numbers.

If an array is sorted, median is the middle element of an array in case of odd number of elements in an array and when number of elements in an array is even than it will be an average of two middle elements.

Median Program In C

1. Algorithm. Algorithm of this program is very easy − START Step 1 → Take an integer list A of n values Step 2 → Arrange the values in the list in some order, say ascending Step 3 → Calculate the middle of list → (n + 1) / 2 Step 4 → Display the middle value as median STOP.
2. Pseudocode.
3. Implementation.
4. Output.

A better version of bubble sort, known as modified bubble sort, includes a flag that is set if an exchange is made after an entire pass over the array. If no exchange is made, then it should be clear that the array is already in order because no two elements need to be switched. In that case, the sort should end.

Quicksort

Answer is C. Worst case complexity of merge sort is O(nlogn).

In ascending order: In Bubble sort, the largest element moves to the right. So swapping is done, when a smaller element is found on the right side. So to count the number of swaps for an element, just count the number of elements on the right side that are smaller than it.

Discussion Forum

So 14 swaps will be done.