The time complexity of the code that determines the number of...

Home / Data Structure / Arrays In Data Structures / Question

Examveda

The time complexity of the code that determines the number of inversions in an array using merge sort is lesser than that of the code that uses loops for the same purpose.

A. true

B. false

Answer: Option A

Related Questions on Arrays in Data Structures

A. O(n)

B. O(1)

C. O(log n)

D. O(n log n)

View Answer

A. int array[];

B. array{int};

C. int array[10];

D. int array();

View Answer

B. null

C. -1

D. undefined

View Answer

A. array.size();

B. array.length;

C. array.length();

D. array.size;

View Answer