Skip to content

An implementation of the parallel merge sort algorithm implemented in Ada

Notifications You must be signed in to change notification settings

huppy309/Concurrent_Merge_Sort

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

Parallel Merge-Sort

I used Ada to implement the parallel Merge-Sort algorithm i.e. each subproblem is handled by a separate "thread" or "task".

Usage

Navigate to the merge_sort/ directory in a linux shell and run the command below. You must have Ada installed:

	./progmain <list of integers>

As an example, an input.txt is included which has numbers in unsorted order. To run the algorithm on that list:

	./progmain < input.txt

If the need arises to recompile:

	gnatmake progmain.adb

The output of the above is the given list of integers in sorted order (and a sum just for fun).

About

An implementation of the parallel merge sort algorithm implemented in Ada

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages