go-challenge

Go to file

Julian Ospald ebbcd71b3d Optimize merging/sorting Previously we sorted a list e.g. [3,2,1] that we already got, then fetched another list e.g. [6,7,8,2]. Instead of just sorting the new list and manually merging it we would sort the appended lists: [1,2,3, 6,7,8,2] Despite mergesort, this is now optimized in a two-step process: * ONLY sort the new list * call a Merge function on both lists, that assumes sorted and deduplicated lists This should be faster.	2017-09-11 16:13:31 +02:00
src	Optimize merging/sorting	2017-09-11 16:13:31 +02:00
.gitignore	Initial commit	2017-09-11 12:08:43 +02:00
go-challenge.txt	Initial commit	2017-09-11 12:08:43 +02:00

Julian Ospald ebbcd71b3d Optimize merging/sorting

Previously we sorted a list e.g. [3,2,1]
that we already got, then fetched another
list e.g. [6,7,8,2]. Instead of just
sorting the new list and manually merging it
we would sort the appended lists:
[1,2,3,  6,7,8,2]

Despite mergesort, this is now optimized in
a two-step process:
* ONLY sort the new list
* call a Merge function on both lists, that assumes
  sorted and deduplicated lists

This should be faster.

2017-09-11 16:13:31 +02:00

src

Optimize merging/sorting

2017-09-11 16:13:31 +02:00

.gitignore

Initial commit

2017-09-11 12:08:43 +02:00

go-challenge.txt

Initial commit

2017-09-11 12:08:43 +02:00