---
title: "Discussion on \"Merge sort | Recursion\" | Hashnode"
description: "Discussion on \"Merge sort | Recursion\". Merge sort is a recursive, divide-and-conquer sorting algorithm with O(n log n) time complexity and O(n) space complexity"
url: "https://hashnode.com/posts/merge-sort-recursion/66afda12f67f42b8208d5e4e"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Merge sort | Recursion](https://vampirepapi.hashnode.dev/merge-sort-recursion?utm_source=hashnode&utm_medium=feed)

Merge sort is a recursive, divide-and-conquer sorting algorithm with O(n log n) time complexity and O(n) space complexity

Aug 4, 2024 · 3 min read · vampirepapi.hashnode.dev  
Read the article

-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#recursion](https://hashnode.com/tag/recursion)
-   [#computer-science](https://hashnode.com/tag/computer-science)
-   [#data-structures](https://hashnode.com/tag/data-structures)

## Written by

[Shubham Sourabh](https://hashnode.com/@vampirepapi)

@vampirepapi · Pune, MH

  
[View profile](https://hashnode.com/@vampirepapi)

engineer @amdocs

Sipping lattes, diving into Linux, conquering Leetcode, and Lifting spirits (and weights) along the way! 🚀

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
