What is the space complexity of the code that uses merge sort for determining the number of inversions in an array?
A. O(n)
B. O(log n)
C. O(1)
D. O(n log n)
Answer: Option A
This Question Belongs to Data Structure >> Arrays In Data Structures
Related Questions on Arrays in Data Structures
What is the time complexity of accessing an element in an array by index?
A. O(n)
B. O(1)
C. O(log n)
D. O(n log n)
Which of the following is the correct way to declare an array in C?
A. int array[];
B. array{int};
C. int array[10];
D. int array();
How do you find the length of an array in Java?
A. array.size();
B. array.length;
C. array.length();
D. array.size;
Join The Discussion