GATE | GATE MOCK 2017 | Question 50
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 ?
(B) O(N Log N)
(C) O(N * N)
(D) O(N Log Log N)
Here we can use the partition algorithm of quick sort for segregation and answer will be O(N).
Choose the first element as pivot whatever may be its sign we don’t care and keep an extra index at pivot position .
Quiz of this Question
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.