Latest Google Aptitude Question SOLUTION: Two n-size arrays are given to you. n1 in decreasing order and n2 in increasing order. If c1 is time complexity for n1 using quicksort and c2 is time complexity for n2 using quic

• Placement Papers
• /
• Google
• /
• Programming

Google Question Papers: GOOGLE Company Profile

(#M40166792) GOOGLE Programming question Keep an EYE

Two n-size arrays are given to you. n1 in decreasing order and n2 in increasing order. If c1 is time complexity for n1 using quicksort and c2 is time complexity for n2 using quicksort. Then –
A) c1 > c2 B) c1 < c2 C) c1 = c2 D) None of these

Asked In Google Devendra Marghade (4 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (5)   (2) Submit Your Solution