Skip to content

Latest commit

 

History

History
 
 

mergesort

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Makefile
Makefile
 
 
README.md
README.md
 
 
bench_test.go
bench_test.go
 
 
go.mod
go.mod
 
 
go.sum
go.sum
 
 
mergesort.go
mergesort.go
 
 
mergesort_test.go
mergesort_test.go
 
 

README.md

Introduction

This is the Merge Sort home work for PingCAP Talent Plan Online of week 1.

There are 16, 000, 000 int64 values stored in an unordered array. Please supplement the MergeSort() function defined in mergesort.go to sort this array.

Requirements and rating principles:

  • (30%) Pass the unit test.
  • (20%) Performs better than sort.Slice().
  • (40%) Have a document to describe your idea and record the process of performance optimization with pprof.
  • (10%) Have a good code style.

NOTE: go 1.12 is required

How to use

Please supplement the MergeSort() function defined in mergesort.go to accomplish the home work.

NOTE:

  1. There is a builtin unit test defined in mergesort_test.go, however, you still can write your own unit tests.
  2. There is a builtin benchmark test defined in bench_test.go, you should run this benchmark to ensure that your parallel merge sort is fast enough.

How to test:

make test

How to benchmark:

make bench