---
title: "Discussion on \"Why Quick Sort is prefer over Merge Sort?\" | Hashnode"
description: "Discussion on \"Why Quick Sort is prefer over Merge Sort?\". Quick sort is used whenever we have less space to sort the array with O(nlogn) time complexity."
url: "https://hashnode.com/posts/why-quick-sort-is-prefer-over-merge-sort/626834913033e09ae73ec90f"
---

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

Discussion

# [Why Quick Sort is prefer over Merge Sort?](https://abhishekvaish.hashnode.dev/why-quick-sort-is-prefer-over-merge-sort?utm_source=hashnode&utm_medium=feed)

Quick sort is used whenever we have less space to sort the array with O(nlogn) time complexity.

Apr 26, 2022 · 3 min read · abhishekvaish.hashnode.dev  
Read the article

-   [#data-structures](https://hashnode.com/tag/data-structures)
-   [#java](https://hashnode.com/tag/java)
-   [#codenewbies](https://hashnode.com/tag/codenewbies)
-   [#beginners](https://hashnode.com/tag/beginners)

## Written by

[Abhishek Vaish](https://hashnode.com/@abhishekvaish)

@abhishekvaish · Uttar Pradesh, India

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

Software Engineer | Data Engineer

Software Engineer | Data Engineer

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
