Google Interview Question: What is the time complexity of sorting an array using merge sort? | Glassdoor

Skip to content Skip to footer

Notifications

Loading...

employer cover photo

Google

Google SDE-intern interview

Google Interview Question

SDE-intern Interview

What is the time complexity of sorting an array using merge sort?

Interview Answer

Anonymous

Jan 22, 2025

The time complexity of sorting an array using merge sort is 𝑂 ( 𝑛 log ⁡ 𝑛 ) O(nlogn), where 𝑛 n is the number of elements in the array

Related searches: Google reviews | Google jobs | Google salaries | Google benefits | Google conversations

Google interviews