What is merge sort? What is the Time & Space Complexity for merge sort?

What is merge sort? What is the Time & Space Complexity for merge sort?

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, pwc, company-specific

目标公司: PricewaterhouseCoopers

参考答案摘要

Merge Sort is a Divide & Conquer algorithm that is used to sort a given input (can be an array or linked list). It involved dividing the input into 2 halves at each step until input has only 1 element...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。