https://github.com/yhabteab/trainee-cpp-sort
Trainee-cpp-sort is an imitation of the satandard sort command. I recommend to use this only for test and learning purposes. I developed this sort program so that I can gradually learn to use C ++.
https://github.com/yhabteab/trainee-cpp-sort
command-line-arguments-parser cpp cpp-sort how-to-code options-parsing sort sort-commands sort-options sortable sorter sorting-algorithms sorting-algorithms-implemented trainee-cpp-sort
Last synced: about 1 year ago
JSON representation
Trainee-cpp-sort is an imitation of the satandard sort command. I recommend to use this only for test and learning purposes. I developed this sort program so that I can gradually learn to use C ++.
- Host: GitHub
- URL: https://github.com/yhabteab/trainee-cpp-sort
- Owner: yhabteab
- License: gpl-2.0
- Created: 2020-05-08T09:00:39.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2020-09-23T14:24:55.000Z (over 5 years ago)
- Last Synced: 2025-01-28T12:43:51.618Z (about 1 year ago)
- Topics: command-line-arguments-parser, cpp, cpp-sort, how-to-code, options-parsing, sort, sort-commands, sort-options, sortable, sorter, sorting-algorithms, sorting-algorithms-implemented, trainee-cpp-sort
- Language: C++
- Homepage:
- Size: 39.1 KB
- Stars: 0
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: COPYING
Awesome Lists containing this project
README
# trainee-cpp-sort
## About
trainee-cpp-sort is a program that has been developed from the beginning and should be an imitation of the standard sort
command. It was only developed for learning and testing purposes, so I cannot guarantee that it will work perfectly with
a real complicated program.
quick sort and merge sort algorithm have also been added to the program, so that with various sort options you have ample
opportunities to simplify your work.
To learn more about what they mean and what they are for, see the bunch of sort options below.
### Parameters
| short Options | long Options | Usage |
| ----------- | ----------- | ---------------- |
| -b | --ignore-leading-blanks | Ignore leading blanks. |
| -f | --ignore-case | Ignore case e.g (uppercase or lowercase) this would be ignored. |
| -n | --numeric-sort | Numeric sort from the lowest the highest. |
| -o | --output[ARG required] | Write result in FILE instead of standard output. |
| -r | --reverse | Reverse the result of sorting. |
| -R | --random-sort | Sort the keys using a random hash. |
| -u | --unique | Only output the first of several matches. |
| -q | --quick-sort | Use quick sort Algorithm. |
| -m | --merge-sort | Use merge sort Algorithm. |
| -h | --help | Display this help and exit the Program. |
### Examples of sort commands..
First of all we have to compile our code and this is done by doing the command as follows ``./build.sh``. This will compile and build your code.
If ``./build.sh`` doesn't work for you, you can try ``chmod +x build.sh`` and it should work now.
And the compiled code is saved in the ``cpp-sort`` file as ``machine code``.
Now we can e.g. execute this command to sort the contents of the ``in.txt`` file ``numeric-sort``.
content of ``in.txt`` file:
```
4
9
6
15
10
3
12
8
7
```
The output looks like this, if you run this command
``./cpp-sort -n in.txt`` OR ``./cpp-sort -n < in.txt``.
```
3
4
6
7
8
9
10
12
15
```
if you would like to sort with quick sort or merge sort you only have to change a little bit when executing
the commands as follows``./cpp-sort -q -n in.txt`` OR ``./cpp-sort --quick-sort -n < in.txt``
And we do the same with merge sort``./cpp-sort -m -n in.txt`` OR ``./cpp-sort --merge-sort -n < in.txt``.
They all work like clockwork.
And if you want to store the sorted values in a new file, you only have to do as follows..
``./cpp-sort -n -o output.txt in.txt`` OR ``./cpp-sort -n --output output.txt < in.txt``
then check the ``output.txt`` file.
### CONTRIBUTING
I hope you have as much fun with it as I have when coding and would be very happy if you would develop the program
further or if you could give me suggestions how I can do it even better.
Your are always welcome to contribute in this repository
Thank you :+1: