Consider an array consisting of ve and +ve numbers. What would be the – McqOptions

MCQOPTIONS

1.	Consider an array consisting of ve and +ve numbers. What would be the worst case time complexity of an algorithm to segregate the numbers having same sign altogether i.e all +ve on one side and then all -ve on the other ?
A.	O(N)
B.	O(N Log N)
C.	O(N * N)
D.	O(N Log Log N)
Answer» B. O(N Log N)

Discussion

No Comment Found

Related MCQs

Consider the declaration char street[10] = "abcdefghi"; Choose the correct remark(s)
A file is preferable to an array of structures because
Pick the correct answers if x is an one dimensional array, then
Choose the correct statements
While sorting a set of names, representing the names as an array of pointers is preferable to representing the names as a two dimensional array of characters because
If arr is a two dimensional array of 10 rows and 12 columns, then arr (5) logically points to the
A set of names can be represented as a
Which of the following concepts make extensive use of arrays?
When does the ArrayIndexOutOfBoundsException occur?
What is the output of the following piece of code? public class array { public static void main(String args[]) { int []arr = {1,2,3,4,5}; System.out.println(arr[5]); } }