Create Quiz

# Count Inversions Quiz Question

## Inversion Count for an array indicates – how far (or close) the array is from being sorted. If the array is already sorted, then the inversion count is 0, but if the array is sorted in the reverse order, the inversion count is the maximum Quiz

You can mute/unmute sounds from here

## You May Get Result Of Count Inversions Quiz Question

Count Inversions Quiz Question
Count Inversions Quiz Question
Count Inversions Quiz Question
Count Inversions Quiz Question

O(1)
O( log n)
O(n)
O(n log n)

O(1)
O( log n)
O(n)
None

## which of the following operations is performed more efficiently by doubly linked list than by linear linked list?

Deleting a node whose location is given
searching an unsorted list for a given item
inserting a node after the node with a given location
None

A
B
C
None

O(1)
O( log n)
O(n)
O(n log n)

## for a linear search in an array of n elements the time complexity for best, worst and average case are …., and …respectively.

O(n) , O(1) and O(n/2)
O(1) , O(n) and O(n/2)
O(1) , O(n) and O(n)
O(1) , O(n) and O((n-1)/2)

15
20
23
None

154
158
157
None