Created with sort tested and working
Create README
Update LICENSE
Update README
Update README
Update README
Update README
Added to readme and made some fixes to sort and permute.
Made it so interchange sorts use minloc

Using minloc should increase the speed of interchange sort.  The idea
for this was taken from fortran-utils, that can be found at
https://github.com/certik/fortran-utils.
Fixed the name of fort_arrange.f90
Fixed error in interchange sort

Fixed error in interchange sort comming from calling minloc without a
dim value.  This causes minloc to return a length one vector, not a
scalar.
Update README

Changed README to reflect the fact that the BLAS depencancy will not be
removed.
Adopted assumed shaped arrays

The code has been chagned to use assumed shaped arrays this
significantly increaed run time when sorting may small lists on Intel
Fortran and had little effect with gfortran.
Moved source files

All sorce files have been moved to the new src folder
Made some subroutines pure

Maked all subroutines I could a pure.
Added unique functions and subs

Added unique functions and suboutines that are all under the interface
unique.
Added Makefile and updated README

Added Makefile and updated README to reflect the Makefile and the added
unique interface.
Added unique map

Added to the unique interface subs that return both the unique vector
and the map to that vector.
Updated Makefile

Updated makefile to work better and crate a static library.
Removed functions from the unique interface

Removed functions from the unique interface as this produced an error
with gfortran, as the interface included both functions and
subroutines.  This did not produce errors in ifort.  I am going to
check if this is becuase if this is a feature of the newer standards or
if it is just an ifort extension.