Medium-Easy Apply Sorting & Searching Multiple Choice

Count inversions in [3,1,2,4]: how many inversions are there?

Apply — Tests ability to use knowledge in practical scenarios.

Answer Options

A 1

B 2

C 3

D 4

Get the answer with a detailed explanation, plus practice 31+ more Sorting & Searching questions with adaptive quizzes and timed interviews.

This question is from the Sorting & Searching topic (Algorithms).

What is the time complexity of binary search on a sorted array of n elements?

Which sorting algorithm is stable and guarantees O(n log n) worst case?

What is the space complexity of mergesort?

Why does quicksort degrade to O(n²) on already-sorted input with last-element pivot?

Implement binary search to find the leftmost occurrence of a target.