Maybe_a_vectorized_ford_johnson

this is a on optimized Ford-Johnson sort algorithm using AVX2 intrinsics and latency friendly

make opti

example :

./PmergeMe `shuf -i 1-3000 -n 3000 | tr "\n" " "`

Name		Name	Last commit message	Last commit date
Latest commit History 19 Commits
Jacobsthal.cpp		Jacobsthal.cpp
Jacobsthal2.cpp		Jacobsthal2.cpp
Makefile		Makefile
Merge_Insertion_sort.pdf		Merge_Insertion_sort.pdf
PmergeMe.cpp		PmergeMe.cpp
PmergeMe.hpp		PmergeMe.hpp
PmergeMe2.cpp		PmergeMe2.cpp
README.md		README.md
compare.cpp		compare.cpp
compare2.cpp		compare2.cpp
main.cpp		main.cpp
test.cpp		test.cpp
utils.cpp		utils.cpp