https://github.com/infogulch/mergesort-m

Multithreaded Merge Sort in C
https://github.com/infogulch/mergesort-m

Last synced: 13 days ago
JSON representation

Multithreaded Merge Sort in C

• Host: GitHub
• URL: https://github.com/infogulch/mergesort-m
• Owner: infogulch
• Created: 2012-11-19T18:35:18.000Z (almost 12 years ago)
• Default Branch: master
• Last Pushed: 2012-11-21T00:18:46.000Z (almost 12 years ago)
• Last Synced: 2024-10-10T22:38:04.241Z (about 1 month ago)
• Language: C
• Size: 168 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Multithreaded Merge Sort in C

This is just a test case and only sorts integers atm. After it actually starts working I might follow the example of `qsort()` and change to use `void*`, `width`, and a caller-defined comparator function.

I attempted to do something resembling unit testing, and it halfway works, but it's not very clean and it certainly doesn't have enough tests.

All sorting tests are checked for correctness.

## Compiling

```

make

```

## Running tests

To run a test on 30 items (default):

```

./test

```

To test a larger number of items:

```

./test 10000

```

### Valgrind

To run the tests in valgrind:

```

make grind

```

    

To test a different number of items:

```

make grind ARGS=10000

```