Build a name sorter. Given a set of names, order that set first by last name, then by any given names the person may have. A name must have at least 1 given name and may have up to 3 given names.
We will execute your submission against a list with a thousand names
- We need a special string comparer to compare the last segment, then pairing other segments.
- The maxium pairs of given name is 3, we can set the boundry. So, we won't waste more computer power even the name from both side is longer than 3 segements.
- The criteria is can be used on a thousand names. Each C# character is 16bit. Assume each name is not longer than 100 characters. So, one thousand name is 200KB if we load them in memory. Considering performance, we can finish all the comparing in memory. If we need process large amount of data, I will suggest split files before compare then merge to control the memory usage.
- Choose docker builder over another vendors for independant.
If you build code directly, you need .NET Core SDK 2.1 installed. For installtion
Or, if you have docker installed, you can use following command to build without SDK.
docker build -t name-sorter .Copy unsorted-names-list.txt to output folder
docker run -it --rm -v $(pwd)/output:/output name-sorterfor PowerShell
docker run -it --rm -v ${PWD}\output:/output name-sorterfor Command window
docker run -it --rm -v %cd%\output:/output name-sorter- Make self-contained distribution will simplify the deployment
- Build targets multiple os
- Integrate versioning into build system
- Move the interfaces to NameSorter.Abastraction
- Move the implementaion to NameSorter.Services
- Implement async interface instead of sync to improve performance in shared environment
- Imporve comment in code to be more consistent and fluent
Since the docker builder file is multi-stage build file, it will create a lot of intermediate images to optimize build speed and footprint of image. To clean up these dangling images
docker rmi $(docker image ls -q -f dangling=true)