---
title: "Discussion on \"An implementation to link-based quick sort and merge sort（by golang）\" | Hashnode"
description: "Discussion on \"An implementation to link-based quick sort and merge sort（by golang）\". introduction\nAs everyone knows,  Quick Sort is an excellent algorithm with average time complexity of \\(O(n\\cdot log(n))\\)。Merge Sort is also a best-known sort algorithm with average time complexity of  \\(O(n\\cdot log(n))\\) and worst time complexity ..."
url: "https://hashnode.com/posts/an-implementation-to-link-based-quick-sort-and-merge-sortby-golang/6326d075dd55cd8b89b21042"
---

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

Discussion

# [An implementation to link-based quick sort and merge sort（by golang）](https://xue1.top/an-implementation-to-link-based-quick-sort-and-merge-sortby-golang?utm_source=hashnode&utm_medium=feed)

introduction As everyone knows, Quick Sort is an excellent algorithm with average time complexity of \\(O(n\\cdot log(n))\\)。Merge Sort is also a best-known sort algorithm with average time complexity of \\(O(n\\cdot log(n))\\) and worst time complexity ...

Sep 18, 2022 · 5 min read · xue1.top  
Read the article

-   [#go](https://hashnode.com/tag/go)
-   [#algorithms](https://hashnode.com/tag/algorithms)

## Written by

[Yuanfei Yang](https://hashnode.com/@yuanfei)

@yuanfei · Beijing, China

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

never give up!

## Responses

Markdown supported · ⌘↵ to post

No responses yet.