GATE | GATE MOCK 2017 | Question 50

Last Updated :
Discuss
Comments

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 ?

O(N)

O(N Log N)

O(N * N)

O(N Log Log N)

This question is part of this quiz :

Top MCQs on Array Data Structure with Answers,GATE 2017 Mock
Tags:
DSA Quiz
GATE
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy